Improvement of the Attribute Reduction Algorithm Based on Rough Set
Liu Ting-cang
Abstract
Liu Ting-cang
Abstract
Attribute reduction is one of the key topics in the rough set theory field,the authors discuss the attribute reduction in rough sets theory.Firstly,the basic attribute reduction algorithm in discernibility matrix is introduced.Then,according to the algorithm of rough sets-GENRED,a new attribute reduction algorithm based on rough sets,is proposed.And the new algorithm can meet the requirement of the attribute reduction and improve the operating 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.
Attribute reduction is one of the key topics in the rough set theory field,the authors discuss the attribute reduction in rough sets theory.Firstly,the basic attribute reduction algorithm in discernibility matrix is introduced.Then,according to the algorithm of rough sets-GENRED,a new attribute reduction algorithm based on rough sets,is proposed.And the new algorithm can meet the requirement of the attribute reduction and improve the operating efficiency.
Key concepts: Rough set, Reduction (mathematics), Attribute domain, Algorithm, Field (mathematics), Key (lock), Data mining, Set (abstract data type)