Rough Sets and Knowledge Technology

Volume 4062 of the series Lecture Notes in Computer Science pp 297-304

On Reduct Construction Algorithms

  • Yiyu YaoAffiliated withDepartment of Computer Science, University of Regina
  • , Yan ZhaoAffiliated withDepartment of Computer Science, University of Regina
  • , Jue WangAffiliated withLaboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences

* Final gross prices may vary according to local VAT.

Get Access


This paper critically analyzes reduct construction methods at two levels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic groups based on the underlying control structures. At a low level, by adopting different heuristics or fitness functions for attribute selection, one is able to derive most of the existing algorithms. The analysis brings new insights into the problem of reduct construction, and provides guidelines for the design of new algorithms.


Reduct construction algorithms deletion strategy addition-deletion strategy addition strategy attribute selection heuristics