Monotone extensions of boolean data sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1316, Issue , 1997, Pages 161-175

  Boros, Endre ^a   Ibaraki, Toshihide ^b   Makino, Kazuhisa ^c  

^a RUTGERS UNIVERSITY   (United States)

^b KYOTO UNIVERSITY   (Japan)

^c OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; ERRORS; POLYNOMIAL APPROXIMATION;

APPROXIMABILITY; BEST FIT; INCOMPLETE DATA; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; REAL-WORLD;

BOOLEAN FUNCTIONS;

EID: 84958059108     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_42     Document Type: Conference Paper

References (18)

1. M. Anthony and N. Biggs, Computational Learning Theory, Cambridge University Press, 1992.
2. A. Ben-David, Monotonicity maintenance in information-theoretic machine learning algorithms, Machine Learning 19 (1995) 29-43.
3. A. Ben-David, L. Sterling and Y. H. Pao, Learning and classification of monotonic ordinal concepts, Computational Intelligence 5 (1989) 45-49.
4. E. Boros, V. Gurvich, P. L. Hammer, T. Ibaraki and A. Kogan, Decomposability of partially defined Boolean functions, Discrete Applied Mathematics, 62 (1995) 51-75.
5. E. Boros, P. L. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz and I. Muchnik, An implementation of logical analysis of data, RUTCOR Research Report RRR 22-96, Rutgers University, 1996.
6. E. Boros, T. Ibaraki and K. Makino, Error-free and best-fit extensions of a partially defined Boolean function, RUTCOR Research Report RRR 14-95, Rutgers University, 1995.
7. E. Boros, T. Ibaraki and K. Makino, Extensions of partially defined Boolean functions with missing data, RUTCOR Research Report RRR 06-96, Rutgers University (1996).
8. E. Boros, T. Ibaraki and K. Makino, Boolean analysis of incomplete examples, SWAT '96 Algorithm Theory, edited by R. Karlsson and A. Lingas, Springer Lecture Notes in Computer Science 1097 (1996) 440-451.
9. Y. Crama, P. L. Hammer and T. Ibaraki, Cause-effect relationships and partially defined boolean functions, Annals of Operations Research, 16 (1988) 299-326.
10. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining, AAAI Press, 1996.
11. D. Kavvadias, C. H. Papadimitriou and M. Sideri, On Horn envelopes and hypergraph transversals, ISAAC'93 Algorithms and Computation, edited by K. W. Ng et al., Springer Lecture Notes in Computer Science 762 (1993) 399-405.
12. M. Kearns, M. Li and L. Valiant, Learning Boolean formulas, Journal of ACM, 41 (1994) 1298-1328.
13. H. W. Kuhn, The Hungarian method for solving the assignment problem, Naval Res. Logist. Quart., 2 (1955) 83-97.
14. H. W. Kuhn, Variants of the Hungarian method for solving the assignment problem, Naval Res. Logist. Quart., 3 (1956) 253-258.
15. K. Makino, K. Hatanaka and T. Ibaraki, Horn extensions of a partially defined Boolean function, RUTCOR Research Report RRR 27-95, Rutgers University, 1995.
16. K. Makino, K. Yano and T. Ibaraki, Positive and Horn decomposability of partially defined Boolean functions, Discrete Applied Mathematics, 74 (1997) 251-274.
17. J. R. Quinlan, Induction of decision trees, Machine Learning 1 (1986) 81-106.
18. L. G. Valiant, A theory of the learnable, Communications of the ACM 27 (1984) 1134-1142.