A New Method for Discretization of Continuous Attributes
Guan Xin
Abstract
Guan Xin
Abstract
Because traditional Rough Sets theory can only deal with discrete attributes, continuous attributes must be converted into discrete attributes before we cope with decision table. In this paper, a new algorithm of consistent discretization in decision table based on rough sets theory is presented for the continuous attributes. The discretization algorithm is performed by selecting the same decision attribute value from the discretized attributes,and classfy the unions as a class. This algorithm is effectively tested by an example. The method’s complexity is analysed and compared with some other discretization algorithms. Results show that using this approach can get reasonable intervals.
A significance statement is not available in the OpenAlex record.
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.
Because traditional Rough Sets theory can only deal with discrete attributes, continuous attributes must be converted into discrete attributes before we cope with decision table. In this paper, a new algorithm of consistent discretization in decision table based on rough sets theory is presented for the continuous attributes. The discretization algorithm is performed by selecting the same decision attribute value from the discretized attributes,and classfy the unions as a class. This algorithm is effectively tested by an example. The method’s complexity is analysed and compared with some other discretization algorithms. Results show that using this approach can get reasonable intervals.
Key concepts: Discretization, Discretization of continuous features, Rough set, Decision table, Mathematics, Class (philosophy), Table (database), Algorithm