An Algorithm for Attribute Reduction Based on Attribute Significance
Weihua Gui
Abstract
Weihua Gui
Abstract
The reduction of attributes is a core contents of Rough Set theory.It is proved that computing all the reduction and the optimal reduction of decision table is a NP typical problem.In this paper,heuristic algorithm is deeply investigated and an improved algorithm is proposed.An example shows the algorithm's efficiency.
OpenAlex reports 1 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.
The reduction of attributes is a core contents of Rough Set theory.It is proved that computing all the reduction and the optimal reduction of decision table is a NP typical problem.In this paper,heuristic algorithm is deeply investigated and an improved algorithm is proposed.An example shows the algorithm's efficiency.
Key concepts: Reduction (mathematics), Rough set, Decision table, Heuristic, Algorithm, Core (optical fiber), Set (abstract data type), Computer science