On Reduct Construction Algorithms.

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. Keywords: Reduct construction algorithms, deletion strategy, addition-deletion strategy, addition strategy, attribute selection heuristics. [ABSTRACT FROM AUTHOR]