A New Discretization Approach of Continuous Attributes
Xu E, Shao Liangshan, Ren Yongchang, Hao Wu, Qiu Feng
Abstract
Xu E, Shao Liangshan, Ren Yongchang, Hao Wu, Qiu Feng
Abstract
To deal with the discretization problem in an information system, a new discretization approach of continuous attributes is proposed in this paper based on the relative entropy and rough set theory. The candidate interval class-information entropy is used to select the threshold boundary for discretization in this method. And the redundant cut points are removed through the inspection of the cut point value of each attribute to discretize the condition attributes and decision attributes in an information system. Experiment results show that the method is simple and effective.
OpenAlex reports 7 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.
To deal with the discretization problem in an information system, a new discretization approach of continuous attributes is proposed in this paper based on the relative entropy and rough set theory. The candidate interval class-information entropy is used to select the threshold boundary for discretization in this method. And the redundant cut points are removed through the inspection of the cut point value of each attribute to discretize the condition attributes and decision attributes in an information system. Experiment results show that the method is simple and effective.
Key concepts: Discretization, Discretization of continuous features, Entropy (arrow of time), Rough set, Computer science, Discretization error, Class (philosophy), Mathematical optimization