The Rejectability Graph of Two Sets of Examples

  • Evangelos Triantaphyllou
Part of the Springer Optimization and Its Applications book series (SOIA, volume 43)


This chapter is based on the findings presented in [Triantaphyllou and Soyster, 1996] and presents the motivation and definition of a special graph which can be easily derived from positive and negative examples. To understand the motivation for introducing this graph, consider a situation with n = 5 attributes.


Boolean Function Maximum Clique Interior Point Method Decomposition Approach Clique Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. Triantaphyllou, E., and A.L. Soyster, (1996), “On the Minimum Number of Logical Clauses Which Can be Inferred From Examples,” Comput. Oper. Res., Vol. 23, No. 8, pp. 783–799.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceLouisiana State UniversityBaton RougeUSA

Personalised recommendations