An Algorithm for Discretization of Condition Attributesin Rough Set Theory
Lingyun Tong
Abstract
Lingyun Tong
Abstract
The discretization of quantitative attributes is the critical factor that limits the application of rough set theory. In this paper, using grade classification method and the concept of dependency degree, an algorithm is presented for discretization of condition attributes in a decision system. Furthermore, attribute reduction can be achieved by using the algorithm. The algorithm is constructed with good understandability and simple computation. In the end, an example illustrates that the algorithm is reasonable and effective.
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.
The discretization of quantitative attributes is the critical factor that limits the application of rough set theory. In this paper, using grade classification method and the concept of dependency degree, an algorithm is presented for discretization of condition attributes in a decision system. Furthermore, attribute reduction can be achieved by using the algorithm. The algorithm is constructed with good understandability and simple computation. In the end, an example illustrates that the algorithm is reasonable and effective.
Key concepts: Discretization, Rough set, Computation, Dependency (UML), Discretization of continuous features, Algorithm, Set (abstract data type), Mathematics