Logical analysis of binary data with missing bits

Artificial Intelligence

Volumn 107, Issue 2, 1999, Pages 219-263

  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

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA MINING; DATA REDUCTION; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; POLYNOMIALS;

KNOWLEDGE DISCOVERY;

KNOWLEDGE BASED SYSTEMS;

EID: 0033077671     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00110-6     Document Type: Article

References (39)

1. R. Agrawal, T. Imielinski, A. Swami, Mining association rules between sets of items in large databases, in: Proc. International Conference on Management of Data (Sigmod-93), 1993, pp. 207-216.
2. E. Amaldi, V. Kann, The complexity of approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sci. 147 (1995) 181-210.
3. D. Angluin, Queries and concept learning, Machine Learning 2 (1988) 319-342.
4. B. Apswall, M.F. Plass, R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inform. Process. Lett. 8 (1979) 121-123.
5. R.L. Ashenhurst, The decomposition of switching functions, in: Proc. International Symposium on the Theory of Switching, Part I, Harvard University Press, Cambridge, MA, 1959, pp. 75-116.
6. S. Ben-David, E. Dichterman, Learning with restricted focus of attention, in: Proc. 6th Annual Workshop on Computational Learning Theory, 1993, pp. 287-296.
7. A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth, Occam's razor, Inform. Process. Lett. 24 (1987) 377-380.
8. E. Boros, V. Gurvich, P.L. Hammer, T. Ibaraki, A. Kogan, Decompositions of partially defined Boolean functions, Discrete Appl. Math. 62 (1995) 51-75.
9. E. Boros, P.L. Hammer, J.N. Hooker, Predicting cause-effect relationships from incomplete discrete observations, SIAM J. Discrete Math. 7 (1994) 531-543.
10. E. Boros, P.L. Hammer, T. Ibaraki, A. Kogan, E. Mayoraz, I. Muchnik, An implementation of logical analysis of data, RUTCOR Research Report RRR 22-96, Rutgers University, Piscataway, NJ, 1996.
11. E. Boros, T. Ibaraki, K. Makino, Error-free and best-fit extensions of a partially defined Boolean function, Inform. and Comput. 140 (1998) 254-283.
12. E. Boros, T. Ibaraki, K. Makino, Extensions of partially defined Boolean functions with missing data, RUTCOR Research Report RRR 06-96, Rutgers University, Piscataway, NJ, 1996.
13. E. Boros, T. Ibaraki, K. Makino, Boolean analysis of incomplete examples, in: R. Karlsson, A. Lingas (Eds.), Algorithm Theory - SWAT-96, Lecture Notes in Computer Science, Vol. 1097, Springer, Berlin, 1996, pp. 440-451.
14. E. Boros, T. Ibaraki, K. Makino, Monotone extensions of Boolean data sets, in: M. Li, A. Maruoka (Eds.), Algorithmic Learning Theory - ALT-97, Lecture Notes in Artificial Intelligence, Vol. 1316, Springer, Berlin, 1997, pp. 440-451.
15. E. Boros, T. Ibaraki, K. Makino, Working paper.
16. Y. Crama, P.L. Hammer, T. Ibaraki, Cause-effect relationships and partially defined Boolean functions, Ann. Oper. Res. 16 (1988) 299-326.
17. R. Dechter, J. Pearl, Structure identification in relational data, Artificial Intelligence 58 (1992) 237-270.
18. L. De Raedt, Logical settings for concept-learning, Artificial Intelligence 95 (1997) 187-201.
19. D.W. Dowling, J.H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, J. Logic Programming 3 (1984) 267-284.
20. L.R. Ford, D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
21. M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, New York, 1979.
22. S.A. Goldman, S.S. Kwek, S.D. Scott, Learning from examples with unspecified attribute values, in: Proc. COLT-97, 1997, pp. 231-242.
23. R. Greiner, A. Grove, A. Kogan, Exploiting the omission of irrelevant data, Artificial Intelligence 97 (1997) 345-380.
24. D. Kavvadias, C.H. Papadimitriou, M. Sideri, On Horn envelopes and hypergraph transversals, in: K.W. Ng et al. (Eds.), Algorithms and Computation - ISAAC-93, Lecture Notes in Computer Science, Vol. 762, Springer, Berlin, 1993, pp. 399-405.
25. R. Khardon, D. Roth, Learning to reason with a restricted view, in: Proc. COLT-95, 1995, pp. 301-310.
26. K. Makino, K. Hatanaka, T. Ibaraki, Horn extensions of a partially defined Boolean function, RUTCOR Research Report RRR 27-95, Rutgers University, Piscataway, NJ, 1995; also: SIAM J. Comput. (to appear).
27. K. Makino, K. Yano, T. Ibaraki, Positive and Horn decomposability of partially defined Boolean functions, Discrete Appl. Math. 74 (1997) 251-274.
28. O.L. Mangasarian, R. Setiono And W.H. Wolberg, Pattern recognition via linear programming: Theory and applications to medical diagnosis, in: T.F. Coleman, Y. Li (Eds.), Large-scale Numerical Optimization, SIAM, Philadelphia, PA, 1990, pp. 22-30.
29. H. Mannila, H. Toivonen, A.I. Verkamo, Efficient algorithms for discovering association rules, in: U.M. Fayyad, R. Uthurusamy (Eds.), AAAI Workshop on Knowledge Discovery in Database, Seattle, WA, 1994, pp. 181-192.
30. S. Muroga, Threshold Logic and its Applications, Wiley-Interscience, New York, 1971.
31. P.M. Murphy, D.W. Aha, UCI Repository of machine learning databases [http://www.ics.uci.edu/mlearn/MLRepository.html], University of California, Department of Information and Computer Science, Irvine, CA, 1994.
32. L. Pitt, L.G. Valiant, Computational limitations on learning from examples, J. ACM 35 (1988) 965-984.
33. J.S. Provan, M.O. Ball, Efficient recognition of matroids and 2-monotonic systems, in: R. Ringeisen, F. Roberts (Eds.), Applications of Discrete Mathematics, SIAM, Philadelphia, PA, 1988, pp. 122-134.
34. J.R. Quinlan, Induction of decision trees, Machine Learning 1 (1986) 81-106.
35. K.G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, Dordrecht, Netherlands, 1990.
36. D. Roth, Learning to reason: The non-monotonic case, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 1178-1184.
37. D. Schuurmans, R. Greiner, Learning default concepts, in: Proc. 20th Canadian Conference on Artificial Intelligence (CSCSI-94), 1994.
38. L.G. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.
39. L.G. Valiant, Rationality, in: Proc. Workshop on Computational Learning Theory (COLT-95), 1995, pp. 3-14.