An Information Representation for Attribute Reduction of Decision Tables in Rough Set Theory
Xu Xue
Abstract
Xu Xue
Abstract
In this paper, relationships between attribute reduction of decision tables and information entropy have been mainly discussed. In a consistent decision table, the equivalence properties between algebraic representation and information representation of attribute reduction are proved. Through examples, it shows that attribute reduction of an inconsistent decision table cannot entirely be represented by information entropy.
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.
In this paper, relationships between attribute reduction of decision tables and information entropy have been mainly discussed. In a consistent decision table, the equivalence properties between algebraic representation and information representation of attribute reduction are proved. Through examples, it shows that attribute reduction of an inconsistent decision table cannot entirely be represented by information entropy.
Key concepts: Decision table, Rough set, Mathematics, Decision rule, Entropy (arrow of time), Representation (politics), Attribute domain, Equivalence (formal languages)