Some Fast Heuristics for Inferring a Boolean Function from Examples

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

Chapter Chapter 4 in Data Mining and Knowledge Discovery via Logic-Based Methods, 2010, pp 73-100 from Springer

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

Keywords: Boolean Function; Candidate List; Evaluative Function; Fast Heuristic; Polynomial Time Complexity (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_4

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

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

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 ().