2002Journal of Hebei University of TechnologyRequires access

An Algorithm for Discretization of Condition Attributesin Rough Set Theory

Lingyun Tong

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Discretization, Rough set, Computation, Dependency (UML), Discretization of continuous features, Algorithm, Set (abstract data type), Mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm for Discretization of Condition Attributesin Rough Set Theory — Research Paper | ScholarLens