论文信息 - The simple-discernibility matrix in rough sets

The simple-discernibility matrix in rough sets

There are some advantages to describe knowledge with discernibility matrix ,As for the discernibility matrix of decision tables, this paper finds that there exist that some redundant information of discernibility matrix. so this paper defines a new discernibility matrix ,which is named Simple Discernibility matrix .it has no redundant information and could reduce the number of comparisons of individuals ,and improve the efficiency.

Shaobo Deng | Min Li

[1] Li Yong. Rough Set Theory and Learning Method Based on Set Theory , 2002 .

[2] Zhou Jia-qing. A new discernibility matrix and the computation of a core , 2007 .

[3] Deng Shao. A Data Reduction Algorithm with Unification of Attribute and Attribute Value , 2009 .

[4] XIAOHUA Hu,et al. LEARNING IN RELATIONAL DATABASES: A ROUGH SET APPROACH , 1995, Comput. Intell..

[5] Li Hai-jun. A Method of Finding the Core for Inconsistent Decision Tables , 2007 .

[6] T. Ushio,et al. Rough sets-based machine learning using a binary discernibility matrix , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).