A Revised Branch-and-Bound Approach for Inferring a Boolean Function from Examples

Evangelos Triantaphyllou ()
Additional contact information
Evangelos Triantaphyllou: Louisiana State University

Chapter Chapter 3 in Data Mining and Knowledge Discovery via Logic-Based Methods, 2010, pp 57-72 from Springer

Abstract: Abstract 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].

Keywords: Boolean Function; Terminal State; Search State; Minimum Cardinality; Horn Clause (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4419-1630-3_3

Ordering information: This item can be ordered from
http://www.springer.com/9781441916303

DOI: 10.1007/978-1-4419-1630-3_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().