Affiliations: [a] Institute of Computer Science, Foundation for Research and Technology - Hellas (FORTH), P.O. Box 1385, GR-711 10 Heraklion, Crete, Greece | [b] Department of Computer Science, University of Crete, P.O. Box 1470, GR-714 09, Heraklion, Crete, Greece
Abstract: A novel concept learning algorithm named, MICSL: Multiple Iterative Constraint Satisfaction based Learning, is presented. The algorithm utilizes mathematical programming and constraint satisfaction techniques towards uniform representation and management of both data and background knowledge. It offers a flexible enough learning framework and respective services. The representation flexibility of MICSL rests on a method that transforms propositional cases, represented as propositional clauses, into constraint equivalents. The theoretical background as well as the validity of the transformation process are analyzed and studied. Following a ‘general-to-specific’ generalization strategy the algorithm iterates on multiple calls of a constraint satisfaction process. The outcome is a consistent set of rules. Each rule composes a minimal model of the given set of cases. Theoretical results relating the solutions of a constraint satisfaction process and the minimal models of a set of cases are stated and proved. The performance of the algorithm on some real-world benchmark domains is assessed and compared with widely used machine learning systems, such as C4.5 and CN2. Issues related to the algorithm's complexity are also raised and discussed.
