Skip to Main content Skip to Navigation
Conference papers

Constructive Induction: A Version Space based Approach

Abstract : By automatically reformulating the problem domain, constructive induction ideally overcomes the defects of the initial description. The reformulation presented here uses the Version Space primitives D(E,F), defined for any pair of examples E and F, as the set of hypotheses covering E and discriminating F. From these primitives we derive a polynomial number of M-of-N concept. Experimentally, many of these concepts turn out to be significant and consistent. A simple learning strategy thus consists of exhaustively exploring these concepts, and retaining those with sufficient quality. Tunable complexity is achieved in the MONKEI algorithm, by considering a user supplied number of primitives D(Ei,Fi), where Ei and Fi are stochastically sampled in the training set. MONKEI demonstrates good performances on some benchmark problems, and obtains outstanding results on the Predictive Toxicology Evaluation challenge.
Complete list of metadata
Contributor : Marc Bonnet Connect in order to contact the contributor
Submitted on : Friday, August 20, 2021 - 5:52:38 PM
Last modification on : Wednesday, November 17, 2021 - 12:29:39 PM
Long-term archiving on: : Sunday, November 21, 2021 - 9:11:16 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-00116569, version 1


Michèle Sebag. Constructive Induction: A Version Space based Approach. International Conference on Artificial Intelligence, Jun 1999, Oslo, Norway. pp.708-713. ⟨hal-00116569⟩



Record views


Files downloads