Approximation Reduction Based on Similarity Relation

  • Authors:
  • Bing Huang;Ling Guo;Xian-zhong Zhou

  • Affiliations:
  • Nanjing Audit University;Nanjing Audit University;Nanjing Audit University

  • Venue:
  • FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Knowledge reduction is one of the most important tasks in rough set theory, and most types of reductions in this area are based on complete information systems. Though one of the extended relations, similarity relation, has been pre- sented in incomplete information systems, which do exist in real world, its reduction approach has not been examined. In this paper, based on similarity relation, the upper and lower approximation reduction are defined in incomplete information systems. The judgment theorems with respect to the consistent sets of the upper and lower approxima- tion reduction are studied, their discernibility matrices are obtained and the approaches of the upper and lower ap- proximation reduction based on discernibility matrices are presented. To overcome its drawback of NP-hard time com- plexity, two heuristic algorithms based on significance of attributes are proposed.