Data Mining and Knowledge Discovery by Means of Monotone Boolean Functions

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

Chapter Chapter 10 in Data Mining and Knowledge Discovery via Logic-Based Methods, 2010, pp 191-227 from Springer

Abstract: Abstract In all previous discussions the problem was how to infer a general Boolean function based on some training examples. Such a Boolean function can be completely inferred if all possible binary examples (states) in the space of the attributes are used for training. Thus, one may never be 100% certain about the validity of the inferred knowledge when the number of training examples is less than 2 n . The situation is different, however, if one deals with the inference of systems that exhibit monotonic behavior. The developments presented in this chapter are based on the award-winning doctoral work of Vetle I. Torvik and in particular on the research results first published in [ aut Torvik, V.I. Torvik and aut Triantaphyllou, E. Triantaphyllou, 2002; 2003; 2004; 2006].

Keywords: Boolean Function; Query Complexity; Conjunctive Normal Form; Inference Algorithm; Inference Process (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_10

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

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

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