Abstract
A central problem in data mining is how to analyze observations grouped into two categories and infer some key patterns that may be implied by these observations. As discussed in Chapter 1, these observations describe different states of nature of the system or phenomenon of interest to the analyst.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Jeroslow, R.G., (1988), “Computation Oriented Reductions of Predicate to Propositional Logic,” Decis. Support Syst., Vol. 4, pp. 183–197.
Quine, W., (1952), “The Problem of Simplifying Truth Functions,” Am. Math. Monthly, Vol. 59, pp. 102–111.
Quinlan, J.R., (1979), “Discovering Rules by Induction from Large Numbers of Examples: A Case Study,” in Expert Systems in the Micro-Electronic Age, D. Michie, (Editor), Edinburgh University Press, Scotland.
Zakrevskij, A.D., (1988), Logic of Recognition, Nauka Publishers, Minsk, Belarus (in Russian).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Triantaphyllou, E. (2010). Inferring a Boolean Function from Positive and Negative Examples. In: Data Mining and Knowledge Discovery via Logic-Based Methods. Springer Optimization and Its Applications, vol 43. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1630-3_2
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1630-3_2
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1629-7
Online ISBN: 978-1-4419-1630-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)