An Approach to Attribute Reduction Based on Rough Set Theory
Lei Wang
Abstract
Lei Wang
Abstract
In this paper,the author discusses the attribute reduction in Rough Sets theory.The paper introduces the concept of the information quantity of decision attribute with relation to given condition attributes,and proves that its changing tendency is monotonously decreasing.The best attribute reduction is the set whose value is the minimum average of relevance of attributes.Then,a new attribute reduction algorithm based on information quantity is developed.An example shows that this algorithm is effective.
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.
In this paper,the author discusses the attribute reduction in Rough Sets theory.The paper introduces the concept of the information quantity of decision attribute with relation to given condition attributes,and proves that its changing tendency is monotonously decreasing.The best attribute reduction is the set whose value is the minimum average of relevance of attributes.Then,a new attribute reduction algorithm based on information quantity is developed.An example shows that this algorithm is effective.
Key concepts: Rough set, Attribute domain, Reduction (mathematics), Relevance (law), Mathematics, Relation (database), Data mining, Variable and attribute