Attribute discretization method based on rough set theory and information entropy
Liu Li-sha
Abstract
Liu Li-sha
Abstract
This paper analyzed the current attribute discretization methods,and put forwards a cut point set computing algorithm.Then defined the cut information entropy,and used it as the importance measurement of cut point.Based on the above method,put forward an attribute discretization algorithm based on the rough set theory and information entropy.In the experiments,detected the effectiveness of the method and compared with other methods.The results show that the method is effective when the sample and attributes number increasing to very large.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper analyzed the current attribute discretization methods,and put forwards a cut point set computing algorithm.Then defined the cut information entropy,and used it as the importance measurement of cut point.Based on the above method,put forward an attribute discretization algorithm based on the rough set theory and information entropy.In the experiments,detected the effectiveness of the method and compared with other methods.The results show that the method is effective when the sample and attributes number increasing to very large.
Key concepts: Discretization, Rough set, Computer science, Entropy (arrow of time), Discretization of continuous features, Algorithm, Information theory, Data mining