Abstract
We revisit an application developed originally using abductive Inductive Logic Programming (ILP) for modeling inhibition in metabolic networks. The example data was derived from studies of the effects of toxins on rats using Nuclear Magnetic Resonance (NMR) time-trace analysis of their biofluids together with background knowledge representing a subset of the Kyoto Encyclopedia of Genes and Genomes (KEGG). We now apply two Probabilistic ILP (PILP) approaches—abductive Stochastic Logic Programs (SLPs) and PRogramming In Statistical modeling (PRISM) to the application. Both approaches support abductive learning and probability predictions. Abductive SLPs are a PILP framework that provides possible worlds semantics to SLPs through abduction. Instead of learning logic models from non-probabilistic examples as done in ILP, the PILP approach applied in this paper is based on a general technique for introducing probability labels within a standard scientific experimental setting involving control and treated data. Our results demonstrate that the PILP approach provides a way of learning probabilistic logic models from probabilistic examples, and the PILP models learned from probabilistic examples lead to a significant decrease in error accompanied by improved insight from the learned results compared with the PILP models learned from non-probabilistic examples.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Alan, H. (2007). Interpretations of probability. In E. N. Zalta (Ed.), The Stanford encyclopedia of philosophy (Winter 2007 edition). Stanford: Stanford University. http://plato.stanford.edu/archives/win2007/entries/probability-interpret.
Alm, E., & Arkin, A. P. (2003). Biological networks. Current Opinion in Structural Biology, 13(2), 193–202.
Angelopoulos, N., & Cussens, J. (2006). Parameter estimation software implementing the f(ailure) a(adjusted) m(aximasation) algorithm for slps. http://scibsfs.bch.ed.ac.uk/~nicos/sware/slps/pe/.
Arvanitis, A., Muggleton, S., Chen, J., & Watanabe, H. (2006). Abduction with stochastic logic programs based on a possible worlds semantics. In Short paper proceedings of the 16th international conference on inductive logic programming, University of Corunna.
Costa, V. S., Damas, L., Reis, R., & Azevedo, R. (2006). Yap Prolog user’s manual. http://www.ncc.up.pt/~vsc/Yap/.
Cussens, J. (2001). Parameter estimation in stochastic logic programs. Machine Learning, 44(3), 245–271.
Cussens, J. (2007). Logic-based formalisms for statistical relational learning. In L. Getoor & B. Taskar (Eds.), Introduction to statistical relational learning (pp. 269–290). Cambridge: MIT Press.
De Raedt, L., & Kersting, K. (2003). Probabilistic logic learning. ACM-SIGKDD Explorations: Special issue on Multi-Relational Data Mining, 5(1), 31–48.
De Raedt, L., & Kersting, K. (2004). Probabilistic inductive logic programming. In S. Ben-David, J. Case, & A. Maruoka (Eds.), Lecture notes in computer science: Vol. 3244. Proceedings of the 15th international conference on algorithmic learning theory. Berlin: Springer.
De Raedt, L., Frasconi, P., Kersting, K., & Muggleton, S. (2008). In Lecture notes in computer science: Vol. 4911. Probabilistic inductive logic programming—theory and applications. Berlin: Springer.
Flach, P., & Kakas, A. (2000). Pure and applied logic. Abductive and inductive reasoning. Dordrecht: Kluwer.
Friedman, N. (1998). The Bayesian structural em algorithm. In G. Cooper & S. Moral (Eds.), Proceedings of the fourteenth annual conference on uncertainty in artificial intelligence (UAI-98) (pp. 129–138). Madison: Morgan Kaufmann.
Getoor, L., & Taskar, B. (2007). Adaptive computation and machine learning. Introduction to statistical relational learning. Cambridge: MIT Press.
Halpern, J. Y. (1989). An analysis of first-order logics of probability. Artificial Intelligence, 46, 311–350.
Haussler, D. (1990). Probably approximately correct learning. In National conference on artificial intelligence (pp. 1101–1108).
Kakas, A., & Denecker, M. (2002). Abduction in logic programming. In A. Kakas & F. Sadri (Eds.), Lecture notes in artificial intelligence: Vol. 2407. Computational logic: logic programming and beyond, part I (pp. 402–436). Berlin: Springer.
Kakas, A. C., Kowalski, R. A., & Toni, F. (1992). Abductive logic programming. Journal of Logic and Computation, 2(6), 719–770.
Kersting, K., & De Raedt, L. (2000). Bayesian logic programs. In Proceedings of the work-in-progress track at the 10th international conference on inductive logic programming (pp. 138–155).
Martensa, H. A., & Dardenne, P. (1998). Validation and verification of regression in small data sets. Chemometrics and Intelligent Laboratory Systems, 44(1–2), 99–121.
MetaLog Project. (2004–2006). http://www.doc.ic.ac.uk/bioinformatics/metalog.
Muggleton, S. (1996). Stochastic logic programs. In L. De Raedt (Ed.), Advances in inductive logic programming (pp. 254–264). Amsterdam: IOS Press.
Muggleton, S. (2000). Learning stochastic logic programs. In L. Getoor & D. Jensen (Eds.), Proceedings of the AAAI2000 workshop on learning statistical models from relational data. Menlo Park: AAAI.
Muggleton, S. (2002a). Learning structure and parameters of stochastic logic programs. Electronic Transactions in Artificial Intelligence, 6.
Muggleton, S. (2002b). Progol version 5.0. http://www.doc.ic.ac.uk/~shm/Software/progol5.0/.
Muggleton, S., & Bryant, C. (2000). Theory completion using inverse entailment. In Proceedings of the 10th international workshop on inductive logic programming (ILP-00) (pp. 130–146). Berlin: Springer.
Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: theory and methods. Journal of Logic Programming, 19–20, 629–679.
Pearl, J. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. Los Altos: Morgan Kaufmann.
Poole, D. (1993). Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64(1), 81–129.
Poole, D. (1997). The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94(1–2), 5–56.
Puech, A., & Muggleton, S. (2003). A comparison of stochastic logic programs and Bayesian logic programs. In IJCAI03 workshop on learning statistical models from relational data. IJCAI.
Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62(1–2), 107–136.
Rissanen, J. (1982). A universal prior for integers and estimation by minimum description length. Annals of Statistics, 11, 416–431.
Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In Proceedings of the 12th international conference on logic programming (ICLP-1995) (pp. 715–729).
Sato, T., Zhou, N.-F., Kameya, Y., & Izumi, Y. (2008). Prism user’s manual (version 1.11.2). http://sato-www.cs.titech.ac.jp/prism/.
Stefan, W., & Steven, C. (2004). Finite mathematics and applied calculus (3rd ed.). Brooks/Cole.
Tamaddoni-Nezhad, A., Chaleil, R., Kakas, A., & Muggleton, S. (2006). Application of abductive ILP to learning metabolic network inhibition from temporal data. Machine Learning, 64, 209–230. doi:10.1007/s10994-006-8988-x.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editors: Hendrik Blockeel, Jude Shavlik, Prasad Tadepalli.
Rights and permissions
About this article
Cite this article
Chen, J., Muggleton, S. & Santos, J. Learning probabilistic logic models from probabilistic examples. Mach Learn 73, 55–85 (2008). https://doi.org/10.1007/s10994-008-5076-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10994-008-5076-4