Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
A Revised Branch-and-Bound Approach 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
This chapter discusses a revised
sub branch-and-bound (B&B)
branch-and-bound (B&B) algorithm for inferring a single clause (in CNF or DNF) from two disjoint sets of binary training examples. This algorithm is an extension of the B&B algorithm described in the previous chapter. Now the states of the search space are described by using more information and this seems to be critical in leading to good search results faster. This chapter is based on the developments first presented in [
aut Triantaphyllou, E.
Triantaphyllou, 1994].