On reduct construction algorithms. (English) Zbl 1154.68513
Gavrilova, Marina L. (ed.) et al., Transactions on Computational Science II. Berlin: Springer (ISBN 978-3-540-87562-8/pbk). Lecture Notes in Computer Science 5150. Journal Subline, 100-117 (2008).
Summary: 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.
For the entire collection see [Zbl 1154.68307].
For the entire collection see [Zbl 1154.68307].
MSC:
| 68T20 | Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) |
