An Incremental Learning Algorithm for Inferring Boolean Functions

  • Evangelos Triantaphyllou
Part of the Springer Optimization and Its Applications book series (SOIA, volume 43)


The previous chapter studied the guided learning problem. In that setting, the analyst has the option to select which unclassified example to send to the oracle for classification and use that information to improve the understanding of the system under consideration. When the new example would unveil the need for an update, one had to use all the existing training examples, plus the newly classified example, to infer a new (and hopefully more accurate) pattern in the form of a Boolean function or other data mining model.


Boolean Function Wall Street Journal Incremental Learn Incremental Approach Binary Attribute 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. Utgoff, P.E., (1989), “Incremental Induction of Decision Trees,” Mach. Learn., Vol. 4, pp. 161–186.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceLouisiana State UniversityBaton RougeUSA

Personalised recommendations