Abstract
Recently, there has been significant work in the integration of probabilistic reasoning with first order logic representations. Learning algorithms for these models have been developed and they all considered modifications in the entire structure. In a previous work we argued that when the theory is approximately correct the use of techniques from theory revision to just modify the structure in places that failed in classification can be a more adequate choice. To score these modifications and choose the best one the log likelihood was used. However, this function was shown not to be well-suited in the propositional Bayesian classification task and instead the conditional log likelihood should be used. In the present paper, we extend this revision system showing the necessity of using specialization operators even when there are no negative examples. Moreover, the results of a theory modified only in places that are responsible for the misclassification of some examples are compared with the one that was modified in the entire structure using three databases and considering four probabilistic score functions, including conditional log likelihood.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baião, F., Mattoso, M., Shavlik, J., Zaverucha, G.: Applying theory revision to the design of distributed databases. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 57–74. Springer, Heidelberg (2003)
Buntine, W.: Theory refinement on Bayesian networks. In: Proceedings 17th Conference Uncertainty in Artificial Intelligence, San Mateo, CA, pp. 52–60 (1991)
Costa, V., Page, D., Qazi, M., Cussens., J.: CLP(BN): Constraint logic programming for probabilistic knowledge. In: Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence (UAI 2003), pp. 517–524 (2003)
Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Machine Learning 29, 131–163 (1997)
Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, Stockholm, Sweeden, pp. 1300–1309 (1999)
Garcez, A., Zaverucha, G.: The connectionist inductive learning and logic programming system. Applied Intelligence 11, 59–77 (1999)
Grossman, D., Domingos, P.: Learning bayesian network classifiers by maximizing conditional likelihood. In: Proceedings of the 21th International Conference on Machine Learning (ICML 2004), pp. 361–368 (2004)
Haddawy, P.: An overview of some recent developments on bayesian problem solving techniques. AI Magazine - Special issue on Uncertainty in AI 20(2), 11–29 (1999)
Kersting, K., De Raedt, L.: Towards combining inductive logic programming with Bayesian networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, pp. 118–131. Springer, Heidelberg (2001)
Kersting, K., De Raedt, L.: Basic principles of learning bayesian logic programs. Technical Report 174, University of Freiburg, Institute for Computer Science, Freiburg, German (2002)
Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proceedings of the International Joint Conference on Artificial Intelligence(IJCAI), pp. 1137–1145 (1995)
Koller, D.: Probabilistic relational models. In: Džeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol. 1634, pp. 3–13. Springer, Heidelberg (1999)
Koller, D., Pfeffer, A.: Learning probabilities for noisy first-order rules. In: Proceedings of the 15th International Joint Conference on Artficial Intelligence (IJCAI 1997), pp. 1316–1323 (1997)
Lam, W., Bacchus, F.: Learning Bayesian belief networks: an approach based on the MDL principle. Computational Intelligence 10(4), 269–293 (1994)
Lloyd, J.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1989)
Mitchell, T.: Machine Learning. McGraw-Hill, New York (1997)
Muggleton, S.: Inductive logic programming. Academic Press, New York (1992)
Muggleton, S.: Inverse entailment and progol. New Generation Computing Journal 13, 245–286 (1995)
Muggleton, S.: Learning structure and parameters of stochastic logic programs. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 198–206. Springer, Heidelberg (2003)
Poole, D.: Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64(1), 81–129 (1993)
Quinlan, J.: Learning logical definitions from relations. Machine Learning 5, 239–266 (1990)
Ramachandran, S., Mooney, R.: Theory refinement of bayesian networks with hidden variables. In: Proceedings of the 15th International Conference on Machine Learning (ICML), pp. 454–462 (1998)
Revoredo, K., Zaverucha, G.: Revision of first-order bayesian classifiers. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol. 2583, pp. 223–237. Springer, Heidelberg (2003)
Richards, B.L., Mooney, R.J.: Automated refinement of first-order Horn-clause domain theories. Machine Learning 19, 95–131 (1995)
Stone, M.: An asymptotic equivalence of choice of model by cross-validation and akaikeś criterion. Journal of the Royal Statistical Society series B 39, 44–47 (1977)
Towell, G., Shavlik, J.: Knowledge-based artificial neural networks. Artificial Intelligence 70(1–2), 119–165 (1994)
Wogulis, J., Pazzani, M.: A methodology for evaluationg theory revision systems: results with Audrey II. In: Proceedings of the 13th International Join Conference on Artificial Intelligence, Chambery, France, pp. 1128–1134 (1993)
Wrobel, S.: First-order theory refinement. In: Raedt, L.D. (ed.) Advances in Inductive Logic Programming, pp. 14–33. IOS Press, Amsterdam (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paes, A., Revoredo, K., Zaverucha, G., Costa, V.S. (2005). Probabilistic First-Order Theory Revision from Examples. In: Kramer, S., Pfahringer, B. (eds) Inductive Logic Programming. ILP 2005. Lecture Notes in Computer Science(), vol 3625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536314_18
Download citation
DOI: https://doi.org/10.1007/11536314_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28177-1
Online ISBN: 978-3-540-31851-4
eBook Packages: Computer ScienceComputer Science (R0)