Research and design of heuristic attribute reduction algorithm
Fan Yang
Abstract
Fan Yang
Abstract
Based on the attribute reduction of rough set, a new algorithm was proposed with two ways.By using binary discernibility matrix,attribute reduction set in the first step could be contributed.Then using recognizable matrix and its important attribute to get attribute reduction in the mean time this reduction is checking whether it is contained by the reduction set in the first step,so as to judge if this reduction set belongs to the feasible one.It's a kind of intuitionistic and effective attribute reduction algorithm with the demonstration of theoretical analysis and experiment.
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.
Based on the attribute reduction of rough set, a new algorithm was proposed with two ways.By using binary discernibility matrix,attribute reduction set in the first step could be contributed.Then using recognizable matrix and its important attribute to get attribute reduction in the mean time this reduction is checking whether it is contained by the reduction set in the first step,so as to judge if this reduction set belongs to the feasible one.It's a kind of intuitionistic and effective attribute reduction algorithm with the demonstration of theoretical analysis and experiment.
Key concepts: Reduction (mathematics), Rough set, Algorithm, Set (abstract data type), Heuristic, Attribute domain, Matrix (chemical analysis), Computer science