Attribute reduction is an important topic in the research of rough set theory, and it has been widely used in many aspects. Reduction based on an identifiable matrix is a common method, but a lot of space is occupied by repetitive and redundant identifiable attribute sets. Therefore, a new method for attribute reduction is proposed, which compresses and stores the identifiable attribute set by a discernibility information tree. In this paper, the discernibility information tree based on a lower approximation identifiable matrix is constructed in an inconsistent decision information system under dominance relations. Then, combining the lower approximation function with the discernibility information tree, a complete algorithm of lower approximation reduction based on the discernibility information tree is established. Finally, the rationality and correctness of this method are verified by an example.

+More

inconsistent decision information system discernibility information tree repetitive and redundant identifiable attribute sets lower approximation identifiable matrix rough set theory dominance relations

Jia Zhang,Xiaoyan Zhang,Weihua Xu,.Lower Approximation Reduction Based on Discernibility Information Tree in Inconsistent Ordered Decision Information Systems. 10 (12),.

Jia Zhang,Xiaoyan Zhang,Weihua Xu,"Lower Approximation Reduction Based on Discernibility Information Tree in Inconsistent Ordered Decision Information Systems" 10

Jia Zhang,Xiaoyan Zhang,Weihua Xu,"Lower Approximation Reduction Based on Discernibility Information Tree in Inconsistent Ordered Decision Information Systems"