Convexity and logical analysis of data

Theoretical Computer Science

Volumn 244, Issue 1-2, 2000, Pages 95-116

  Ekin, Oya ^a   Hammer, Peter L ^b   Kogan, Alexander ^b,c  

^a BILKENT UNIVERSITY   (Turkey)

^b RUTGERS UNIVERSITY   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Classification; Computational learning theory; Orthogonal disjunctive normal forms; Partially defined Boolean functions; Polynomial algorithms

Indexed keywords

EID: 0346707534     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00337-5     Document Type: Article

References (15)

1. M. Anthony, N. Biggs, Computational Learning Theory, Cambridge University Press, Cambridge, 1992.
2. M.O. Ball, G.L. Nemhauser, Matroids and a reliability analysis problem, Math. Oper. Res. 4 (1979) 132-143.
3. A. Beimel, F. Bergadano, N.H. Bshouty, E. Kushilevitz, S. Varricchio, On the applications of multiplicity automata in learning, in: Proc. 37th Annual IEEE Symp. on Foundations of Computer Science (FOCS'1996), pp. 349-358.
4. A. Blake, Canonical expressions in Boolean algebra, Ph.D. Thesis, University of Chicago, August 1937.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Machinery 36 (4) (1989) 929-965.
6. E. Boros, P.L. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz, I. Muchnik, An implementation of logical analysis of data, IEEE Transactions on Knowledge and Data Engineering, accepted for publication.
7. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist. 23 (1952) 493-509.
8. C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, New York, 1987.
9. Y. Crama, P.L. Hammer, T. Ibaraki, Cause-effect relationships and partially defined Boolean functions, Ann. Oper. Res. 16 (1988) 299-326.
10. A. Ehrenfeucht, D. Haussler, M. Kearns, L. Valiant, A general lower bound on the number of examples needed for learning, Inform. Comput. 82 (3) (1989) 247-261.
11. O. Ekin, P.L. Hammer, A. Kogan, On connected Boolean functions, Discrete Appl. Math., accepted for publication.
12. P.L. Hammer, S. Rudeanu, Boolean Methods in Operations Research, Springer, Berlin, 1968.
13. M.J. Kearns, U.V. Vazirani, An Introduction to Computational Learning Theory, MIT Press, Cambridge, MA, 1994.
14. W. Quine, A way to simplify truth functions, Amer. Math. Monthly 62 (1955) 627-631.
15. K.G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, Dordrecht, 1990.