JOURNAL OF CHINA UNIVERSITIES OF POSTS AND TELECOM ›› 2017, Vol. 24 ›› Issue (4): 57-68.doi: 10.1016/S1005-8885(17)60224-3

• Networks • Previous Articles     Next Articles

Generalized binary discernibility matrix for attribute reduction in incomplete information systems


  • Received:2017-01-10 Revised:2017-06-19 Online:2017-08-30 Published:2017-08-30
  • Contact: Fu-Min MA
  • Supported by:
    National Science Foundation of China

Abstract: To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis.

Key words: rough sets, generalized binary discernibility matrix, attribute relative reduction, incomplete information system

CLC Number: