Sequential covering rule induction algorithm for variable consistency rough set approaches

  • Authors:
  • Jerzy Błaszczyński;Roman Słowiński;Marcin Szelg

  • Affiliations:
  • Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland;Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland and Systems Research Institute, Polish Academy of Sciences, 01-447 Warsaw, Poland;Institute of Computing Science, Poznań University of Technology, 60-965 Poznań, Poland

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2011

Quantified Score

Hi-index 0.07

Visualization

Abstract

We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used for both ordered and non-ordered data. In the case of ordered data, the rough set model employs dominance relation, and in the case of non-ordered data, it employs indiscernibility relation. VC-DomLEM generates a minimal set of decision rules. These rules are characterized by a satisfactory value of the chosen consistency measure. We analyze properties of induced decision rules, and discuss conditions of correct rule induction. Moreover, we show how to improve rule induction efficiency due to application of consistency measures with desirable monotonicity properties.