Probabilistic first-order theory revision from examples

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3625, Issue , 2005, Pages 295-311

  Paes, Aline ^a   Revoredo, Kate ^a   Zaverucha, Gerson ^a   Costa, Vitor Santos ^a,b  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b UNIVERSITY OF WISCONSIN SCHOOL OF MEDICINE AND PUBLIC HEALTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; DATABASE SYSTEMS; FORMAL LOGIC; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS;

BAYESIAN CLASSIFICATION; PROBABILISTIC FIRST-ORDER THEORY;

PROBABILITY;

EID: 26944453186     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11536314_18     Document Type: Conference Paper

References (28)

1. [Baião et al., 2003] Baião, F., Mattoso, M., Shavlik, J., and Zaverucha, G. (2003). Applying theory revision to the design of distributed databases. In Proceedings of the the 13th Int. Conference on Inductive Logic Programming, LNAI 2835, Springer Verlag, pages 57-74.
2. [Buntine, 1991] Buntine, W. (1991). Theory refinement on Bayesian networks. In Proceedings 17th Conference Uncertainty in Artificial Intelligence, pages 52-60, San Mateo, CA.
3. [Costa et al., 2003] Costa, V., Page, D., Qazi, M., and Cussens., J. (2003). CLP(BN): Constraint logic programming for probabilistic knowledge. In Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI-03), pages 517-524.
4. [Friedman et al., 1997] Friedman, N., Geiger, D., and Goldszmidt, M. (1997). Bayesian network classifiers. Machine Learning, 29:131-163.
5. [Friedman et al., 1999] Friedman, N., Getoor, L., Koller, D., and Pfeffer, A. (1999). Learning probabilistic relational models. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 1300-1309, Stockholm, Sweeden.
6. [Garcez and Zaverucha, 1999] Garcez, A. and Zaverucha, G. (1999). The connectionist inductive learning and logic programming system. Applied Intelligence, 11:59-77.
7. [Grossman and Domingos, 2004] Grossman, D. and Domingos, P. (2004). Learning bayesian network classifiers by maximizing conditional likelihood. In Proceedings of the 21th International Conference on Machine Learning (ICML-04), pages 361-368.
8. [Haddawy, 1999] Haddawy, P. (1999). An overview of some recent developments on bayesian problem solving techniques. AI Magazine - Special issue on Uncertainty in AI, 20(2): 11-29.
9. [Kersting and De Raedt, 2001] Kersting, K. and De Raedt, L. (2001). Towards combining inductive logic programming with Bayesian networks. In Proceedings of the 12th Int. Conference on Inductive. Logic Programming, LNAI 2157 Springer Verlag, pages 118-131, Strasbourg, France.
10. [Kersting and De Raedt, 2002] Kersting, K. and De Raedt, L. (2002). Basic principles of learning bayesian logic programs. Technical Report 174, University of Freiburg, Institute for Computer Science, Freiburg, German.
11. [Kohavi, 1995] Kohavi, R. (1995). A study of cross-validation and bootstrap for accuracy estimation and model selection. In Proceedings of the International Joint Conference on Artificial Intelligence(IJCAI), pages 1137-1145.
12. [Koller, 1999] Koller, D. (1999). Probabilistic relational models. In Proceedings of the 9th Int. Conference on Inductive Logic Programming, LNAI 1634, Springer Verlag, pages 3-13.
13. [Koller and Pfeffer, 1997] Koller, D. and Pfeffer, A. (1997). Learning probabilities for noisy first-order rules. In Proceedings of the 15th International Joint Conference on Artficial Intelligence (IJCAI-97), pages 1316-1323.
14. [Lam and Bacchus, 1994] Lam, W. and Bacchus, F. (1994). Learning Bayesian belief networks: an approach based on the MDL principle. Computational Intelligence, 10(4):269-293.
15. [Lloyd, 1989] Lloyd, J. (1989). Foundations of Logic Programming. Springer Verlag, 2 edition.
16. [Mitchell, 1997] Mitchell, T. (1997). Machine Learning. McGraw-Hill, New York.
17. [Muggleton, 1992] Muggleton, S. (1992). Inductive logic programming. Academic Press, New York.
18. [Muggleton, 1995] Muggleton, S. (1995). Inverse entailment and progol. New Generation Computing Journal, 13:245-286.
19. [Muggleton, 2002] Muggleton, S. (2002). Learning structure and parameters of stochastic logic programs. In Proceedings of the 12th Int. Conference on Inductive Logic Prgramming, LNAI 2583, Springer Verlag, pages 198-206.
20. [Poole, 1993] Poole, D. (1993). Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64(1):81-129.
21. [Quinlan, 1990] Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5:239-266.
22. [Ramachandran and Mooney, 1998] Ramachandran, S. and Mooney, R. (1998). Theory refinement of bayesian networks with hidden variables. In Proceedings of the 15th International Conference on Machine Learning (ICML), pages 454-462.
23. [Revoredo and Zaverucha, 2002] Revoredo, K. and Zaverucha, G. (2002). Revision of first-order Bayesian classifiers. In Proceedings of the 12th Int. Conference on Inductive Logic Programming, LNAI 2583, Springer Verlag, pages 223-237.
24. [Richards and Mooney, 1995] Richards, B. L. and Mooney, R. J. (1995). Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19:95-131.
25. [Stone, 1977] Stone, M. (1977). An asymptotic equivalence of choice of model by cross-validation and akaike's criterion. Journal of the Royal Statistical Society series B, 39:44-47.
26. [Towell and Shavlik, 1994] Towell, G. and Shavlik, J. (1994). Knowledge-based artificial neural networks. Artificial Intelligence, 70(1-2): 119-165.
27. [Wogulis and Pazzani, 1993] Wogulis, J. and Pazzani, M. (1993). A methodology for evaluationg theory revision systems: results with Audrey II. In Proceedings of the 13th International Join Conference on Artificial Intelligence, pages 1128-1134, Chambery, France.
28. [Wrobel, 1996] Wrobel, S. (1996). First-order theory refinement. In Raedt, L. D., editor, Advances in Inductive Logic Programming, pages 14-33. IOS Press.