The algorithm on knowledge reduction in incomplete information systems

  • Authors:
  • Jiye Liang;Zongben Xu

  • Affiliations:
  • Department of Computer Science, Shanxi University, Taiyuan, 030006, People's Republic of China;Institute for Information and System Science, Faculty of Science, Xi'an Jiaotong University, Xi'an, 710049, People's Republic of China

  • Venue:
  • International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system. Main reason of causing NP-hard is combination problem of attributes. In this paper, knowledge reduction is defined from the view of information, a heuristic algorithm based on rough entropy for knowledge reduction is proposed in incomplete information systems, the time complexity of this algorithm is O(|A|2|U|). An illustrative example is provided that shows the application potential of the algorithm.