Efficient Specialization of Relational Concepts
Abstract
An algorithm is presented for a common induction problem, the specialization of overty general concepts. A concept is too general when it matches a negative example. The particular case addressed here assumes that concepts are represented as conjunctions of positive literals, that specialization is performed by conjoining literals to the overly general concept, and that the resulting specializations are to be as general as possible. Although the problem is NP-hard, there exists an algorithm, based on manipulation of bit vectors, that has provided good performance in practice.
Cite
Text
VanLehn. "Efficient Specialization of Relational Concepts." Machine Learning, 1989. doi:10.1007/BF00114805Markdown
[VanLehn. "Efficient Specialization of Relational Concepts." Machine Learning, 1989.](https://mlanthology.org/mlj/1989/vanlehn1989mlj-efficient/) doi:10.1007/BF00114805BibTeX
@article{vanlehn1989mlj-efficient,
title = {{Efficient Specialization of Relational Concepts}},
author = {VanLehn, Kurt},
journal = {Machine Learning},
year = {1989},
pages = {99-106},
doi = {10.1007/BF00114805},
volume = {4},
url = {https://mlanthology.org/mlj/1989/vanlehn1989mlj-efficient/}
}