2010 | OriginalPaper | Buchkapitel
Some Fast Heuristics for Inferring a Boolean Function from Examples
verfasst von : Evangelos Triantaphyllou
Erschienen in: Data Mining and Knowledge Discovery via Logic-Based Methods
Verlag: Springer US
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The previous two chapters discussed the development and key mathematical properties of some branch-and-bound (B&B) branch-and-bound (B&B) approaches for inferring a Boolean function in the form of a compact (i.e., with as few clauses as possible) CNF or DNF expression from two collections of disjoint examples. As was described in Chapters 2 and 3, the B&B approaches may take a long time to run (actually, they are of exponential time complexity).