Attribute Reduction Based on Improved Discernibility Matrix
The attribute reduction based on information entropy is different to that based on positive region in inconsistent information system. The problem of discernibility matrix in algebra view is analyzed,and an new discernibility matrix based on information entropy is proposed in this paper. This algorithm considers whether the objects compared are consistent,analyses in detail the degree of inconsistency and the distributing proportion of their conditional equivalent classes in decision classes,and the reduction based on information entropy is acquired finally. The theoretic analysis and simulation instance shows that this algorithm is feasible and effective in practice.
rough set attribute reduction information entropy discernibility matrix
Zhou Peng Li Zhishu Huang Zhiguo
College of Computer Science Sichuan University Chengdu,Sichuan,610065,China;International College Hu College of Computer Science Sichuan University Chengdu,Sichuan,610065,China International College Huanghuai University Zhumadian,Henan 463000
国际会议
成都
英文
1880-1883
2010-04-16（万方平台首次上网日期，不代表论文的发表时间）