An Attribute Reduction Algorithm Based on the Knowledge Quantity
Liang Chun-hua
Abstract
Liang Chun-hua
Abstract
Attribute reduction is an important problem in rough set theory.Based on the viewpoint that attributes have different discerniblity ability in rough set theory, a new attribute reduction algorithm is presented and it quantify knowledge and prove quantify reasonableness,quantified discerniblity ability as heuristic information guiding reduct computation that can improve reduct efficiency.Though running an example,we show that this algorithm is effective.
OpenAlex reports 2 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 an important problem in rough set theory.Based on the viewpoint that attributes have different discerniblity ability in rough set theory, a new attribute reduction algorithm is presented and it quantify knowledge and prove quantify reasonableness,quantified discerniblity ability as heuristic information guiding reduct computation that can improve reduct efficiency.Though running an example,we show that this algorithm is effective.
Key concepts: Reduct, Rough set, Computer science, Reduction (mathematics), Attribute domain, Heuristic, Computation, Data mining