期刊
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS
卷 42, 期 7, 页码 721-738出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/03081079.2013.781166
关键词
rough sets; discernibility matrix; entropy; attribute reduction
资金
- National Natural Science Foundation of China [71031006, 61202018, 60903110]
- Science and Technology Basic Condition Platform Construction Project of Shanxi Province [2012091002-0101]
- Key Project of Science and Technology of Shanxi Province [20110321027-01]
- Special Prophase Project for the National Key Basic Research and Development Program of China (973) [2011CB311805]
- Natural Science Foundation of Shanxi Province [2010021017-3]
In rough set theory, attribute reduction is a basic issue, which aims to hold the discernibility of the attribute set. To obtain all of the reducts of an information system or a decision table, researchers have introduced many discernibility matrices based reduction methods. However, the reducts in the sense of positive region can only be obtained by using the existing discernibility matrices. In this paper, we introduce two discernibility matrices in the sense of entropies (Shannon's entropy and complement entropy). By means of the two discernibility matrices, we can achieve all of the reducts in the sense of Shannon's entropy and all of the reducts in the sense of complement entropy, respectively. Furthermore, we discover the relationships among the reducts in the sense of preserving positive region, Shannon's entropy and complement entorpy. The experimental studies show that by the proposed decision-relative discernibility matrices based reduction methods, all the reducts of a decision table in sense of entropies can be obtained.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据