An Improved Heuristic Algorithm of Attribute Reduction in Rough Set
ShunxiangWu, MaoqingLi, WentingHuang, SifengLiu
Abstract
ShunxiangWu, MaoqingLi, WentingHuang, SifengLiu
Abstract
This paper introduces background of rough set theory, then proposes a new algorithm for finding optimal reduction and make comparison between the original algorithm and the improved one by the experiment about the nine standard data set in UL database to explain the validity of the improved heuristic algorithm.
OpenAlex reports 11 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.
This paper introduces background of rough set theory, then proposes a new algorithm for finding optimal reduction and make comparison between the original algorithm and the improved one by the experiment about the nine standard data set in UL database to explain the validity of the improved heuristic algorithm.
Key concepts: Rough set, Reduction (mathematics), Heuristic, Algorithm, Set (abstract data type), Computer science, Null-move heuristic, Data set