A unifying framework for concept-learning algorithms
- 1 September 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Knowledge Engineering Review
- Vol. 7 (3) , 251-269
- https://doi.org/10.1017/s0269888900006366
Abstract
A unifying framework for concept-learning, derived from Mitchell's Generalization as Search-paradigm, is presented. Central to the framework is the generic algorithm Gencol. Gencol forms a synthesis of existing concept-learning algorithms as it identifies the key issues in concept-learning: the representation of concepts and examples, the search strategy and heuristics, and the operators that transform one concept-description into another one when searching the concept description space. Gencol is relevant for practical purposes as it offers a solid basis for the design and implementation of concept-learning algorithms. The presented framework is quite general as seemingly disparate algorithms such as TDIDT, AQ, MIS and version spaces fit into Gencol.Keywords
This publication has 21 references indexed in Scilit:
- Sloppy modelingPublished by Springer Nature ,2005
- Principles of induction and approaches to attribute based inductionThe Knowledge Engineering Review, 1991
- Generalized subsumption and its applications to induction and redundancyArtificial Intelligence, 1988
- Machine Invention of First-order Predicates by Inverting ResolutionPublished by Elsevier ,1988
- Hill-Climbing Theories of LearningPublished by Elsevier ,1987
- Induction of decision treesMachine Learning, 1986
- Machine LearningPublished by Springer Nature ,1983
- Generalization as searchArtificial Intelligence, 1982
- An interference matching technique for inducing abstractionsCommunications of the ACM, 1978
- Language identification in the limitInformation and Control, 1967