Minimal Element Selection in the Discernibility Matrix for Attribute Reduction?

• 作者: JIANG Yu
• 来源期刊: 中国电子杂志（英文版）
• 年，卷（期）: 2019,（1）
• 页码范围: 6-12
• 页数: 7页
• 语种: 英文
• DOI: 10.1049/cje.2018.06.018

摘要

Discernibility matrix is a beautiful theoretical result to get reducts in the rough set, but the existing algorithms based on discernibility matrix share the same problem of heavy computing load and large store space, since there are numerous redundancy elements in discernibility matrix and these algorithms employ all elements to find reducts. We introduce a new method to compute attribute significance. A novel approach is proposed, called minimal element selection tree, which utilizes many strategies to eliminate redundancy elements in discernibility matrix. This paper presents two methods to find out a minimal reduct for a given decision table based this tree structure. The experimental results with UCI data show that the proposed approaches are effective and efficient than the benchmark methods.