Advertisement

Machine Learning

, Volume 70, Issue 2–3, pp 169–188 | Cite as

Generalized ordering-search for learning directed probabilistic logical models

  • Jan Ramon
  • Tom Croonenborghs
  • Daan Fierens
  • Hendrik Blockeel
  • Maurice Bruynooghe
Article

Abstract

Recently, there has been an increasing interest in directed probabilistic logical models and a variety of formalisms for describing such models has been proposed. Although many authors provide high-level arguments to show that in principle models in their formalism can be learned from data, most of the proposed learning algorithms have not yet been studied in detail. We introduce an algorithm, generalized ordering-search, to learn both structure and conditional probability distributions (CPDs) of directed probabilistic logical models. The algorithm is based on the ordering-search algorithm for Bayesian networks. We use relational probability trees as a representation for the CPDs. We present experiments on a genetics domain, blocks world domains and the Cora dataset.

Keywords

Bayesian networks Probabilistic logical models Ordering-search 

References

  1. Blockeel, H., & De Raedt, L. (1998). Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1–2), 285–297. MATHCrossRefMathSciNetGoogle Scholar
  2. Croonenborghs, T., Ramon, J., Blockeel, H., & Bruynooghe, M. (2007). Online learning and exploiting relational models in reinforcement learning. In M. Veloso (Ed.), Proceedings of the 20th international joint conference on artificial intelligence (pp. 726–731), Hyderabad, India. Menlo Park: AAAI Press. Google Scholar
  3. De Raedt, L., & Kersting, K. (2004). Probabilistic inductive logic programming. In Lecture notes in computer science : Vol. 3244. Proceedings of the 15th international conference on algorithmic learning theory (pp. 19–36). Berlin: Springer. Google Scholar
  4. Fierens, D., Blockeel, H., Bruynooghe, M., & Ramon, J. (2005a). Logical Bayesian networks and their relation to other probabilistic logical models. In Lecture notes in computer science : Vol. 3625. Proceedings of the 15th international conference on inductive logic programming (pp. 121–135). Berlin: Springer. Google Scholar
  5. Fierens, D., Ramon, J., Blockeel, H., & Bruynooghe, M. (2005b). A comparison of approaches for learning first-order logical probability estimation trees. In 15th international conference on inductive logic programming, late-breaking papers (pp. 11–16). Technische Universität München. (Technical Report TUM-I0510, Technische Universität München). Google Scholar
  6. Getoor, L., Friedman, N., Koller, D., & Pfeffer, A. (2001). Learning probabilistic relational models. In S. Dzeroski & N. Lavrac (Eds.), Relational data mining (pp. 307–334). Berlin: Springer. Google Scholar
  7. Heckerman, D., Geiger, D., & Chickering, D. (1995). Learning Bayesian networks: the combination of knowledge and statistical data. Machine Learning, 20, 197–243. MATHGoogle Scholar
  8. Kersting, K., De Raedt, L. (2001). Towards combining inductive logic programming and Bayesian networks. In C. Rouveirol & M. Sebag (Eds.), Lecture notes in computer science : Vol. 2157. Proceedings of the 11th international conference on inductive logic programming (pp. 118–131). Berlin: Springer. CrossRefGoogle Scholar
  9. McCallum, A., Nigam, K., & Rennie, J., Seymore, K. (1999). A machine learning approach to building domain-specific search engines. In Proceedings of the 16th international joint conference on artificial intelligence (pp. 662–667). Los Altos: Kaufmann. Google Scholar
  10. Neapolitan, R. (2003). Learning Bayesian networks. Prentice Hall: Upper Saddle River. Google Scholar
  11. Neville, J., & Jensen, D. (2004). Dependency networks for relational data. In Proceedings of the 4th IEEE international conference on data mining. Los Alamitos: IEEE Computer Society. Google Scholar
  12. Neville, J., Jensen, D., Friedland, L., & Hay, M. (2003). Learning relational probability trees. In Proceedings of the 9th ACM SIGKDD international, conference on knowledge discovery and data mining. New York: ACM. Google Scholar
  13. Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62(1–2), 107–136. CrossRefGoogle Scholar
  14. Slaney, J., & Thiébaux, S. (2001). Blocks world revisited. Artificial Intelligence, 125(1–2), 119–153. MATHCrossRefMathSciNetGoogle Scholar
  15. Teyssier, M., & Koller, D. (2005). Ordering-based search: a simple and effective algorithm for learning Bayesian networks. In Proceedings of the 21st conference on uncertainty in AI (pp. 584–590). Edinburgh: AUAI Press. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Jan Ramon
    • 1
  • Tom Croonenborghs
    • 1
  • Daan Fierens
    • 1
  • Hendrik Blockeel
    • 1
  • Maurice Bruynooghe
    • 1
  1. 1.Dept. of Computer ScienceK.U. LeuvenLeuvenBelgium

Personalised recommendations