2011•Journal of Zhengzhou University of Light IndustryRequires access

Research and design of heuristic attribute reduction algorithm

Fan Yang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

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

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Research and design of heuristic attribute reduction algorithm — Research Paper | ScholarLens