A heuristic reduction algorithm in IIS based on binary matrix

  • Authors:

  • Huaxiong Li;Xianzhong Zhou;Meimei Zhu

  • Affiliations:

  • School of Management and Engineering, Nanjing University, Nanjing, Jiangsu, P.R. China and State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;School of Management and Engineering, Nanjing University, Nanjing, Jiangsu, P.R. China and State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, P.R. China;School of Management and Engineering, Nanjing University, Nanjing, Jiangsu, P.R. China

  • Venue:
  • RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A binary discernibility matrix is presented in this paper, upon which a binary matrix-based heuristic reduction algorithm in incomplete information system(IIS) is proposed. In the proposed algorithm, the problem of finding an attribute reduction is converted to the problem of searching a set of binary matrices that can cover the objective binary matrix. The heuristic function in the proposed heuristic reduction algorithm is defined by a discernibility matrix associated with each condition attribute, which denotes the classification significance of the condition attribute. In the proposed heuristic reduction algorithm, attribute reduct is constructed by adding attributes in the sequence of attribute significance. An example of incomplete information system is presented to illustrate the algorithm and its validity. The algorithm is proved to be effective based on an illustrative example.