Efficient Specialization of Relational Concepts

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


An algorithm is presented for a common induction problem, the specialization of overly 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.

Original languageEnglish (US)
Pages (from-to)99-106
Number of pages8
JournalMachine Learning
Issue number1
StatePublished - Oct 1989
Externally publishedYes


  • concept induction
  • specialization
  • version spaces

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence


Dive into the research topics of 'Efficient Specialization of Relational Concepts'. Together they form a unique fingerprint.

Cite this