Abstract
Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn structures of probabilistic relational model (PRM) from incomplete relational data. The missing values are filled in randomly at first, and a maximum likelihood tree (MLT) is generated from the complete data sample. Then, Gibbs sampling is combined with MLT to modify the data and regulate MLT iteratively for obtaining a well-completed data set. Finally, probabilistic structure is learned through dependency analysis from the completed data set. Experiments show that the MGDA approach can learn good structures from incomplete relational data.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Anderson, C., Domingos, P., Weld, D.: Relational Markov models and their application to adaptive web navigation. In: KDD 2002, Edmonton, Canada, pp. 143–152 (2002)
Cheng, J., Greiner, R., Kelly, J.: Learning Bayesian networks from data: An efficient algorithm based on information theory. Artificial Intelligence 137, 43–90 (2002)
Chickering, D.M.: Learning Bayesian networks is NP-complete. In: Fisher, D., Lenz, H.J. (eds.) Learning from Data: Artificial Intelligence and Statistics V, pp. 121–130. Springer, Berlin (1996)
Chow, C.K., Liu, C.N.: Approximating discrete probability distributions with dependence trees. IEEE Trans. Information Theory 14, 462–467 (1968)
De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic prolog and its application in link discovery. In: IJCAI 2007, Hyderabad, India, pp. 2462–2467 (2007)
Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society - B 39, 1–39 (1977)
Domingos, P., Pazzani, M.: On the optimality of the simple Bayesian classifier under zero-one loss. Machine Learning 29, 103–130 (1997)
Dzeroski, S., Lavrac, N. (eds.): Relational Data Mining. Springer, Berlin (2001)
Flach, P., Lachiche, N.: Naive Bayesian classification of structured data. Machine Learning 57, 233–269 (2004)
Friedman, N.: The Bayesian structural EM algorithm. In: UAI 1998, Madison, WI (1998)
Friedman, N., Getoor, L., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: IJCAI 1999, Stockholm, Sweden, pp. 1300–1307 (1999)
Geman, S., Geman, D.: Stochastic relaxation: Gibbs distributions and the Bayesian restoration of images. IEEE Trans. Pattern Analysis and Machine Intelligence 6, 721–742 (1984)
Getoor, L., Sahami, M.: Using probabilistic relational models for collaborative filtering. In: Masand, B., Spiliopoulou, M. (eds.) WebKDD 1999. LNCS (LNAI), vol. 1836, Springer, Heidelberg (2000)
Getoor, L., Segal, E., Taskar, B., Koller, D.: Probabilistic models of text and link structure for hypertext classification. In: IJCAI 2001 Workshop on Text Learning, Seattle, WA, pp. 24–29 (2001)
Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of link structure. Journal of Machine Learning Research 3, 679–707 (2002)
Kersting, K., De Raedt, L.: Basic principles of learning Bayesian logic programs. Technical report, Institute for Computer Science, University of Freiburg, Freiburg, Germany (2002)
Li, X.L., Zhou, Z.H.: An approach to learning of PRM from incomplete relational data (in chinese). Chinese Journal of Software (2007) (in press)
Muggleton, S. (ed.): Inductive Logic Programming. Academic Press, London (1992)
Muggleton, S.: Stochastic logic programs. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 254–264. IOS, Amsterdam, The Netherland (1996)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA (1988)
Richardson, M., Domingos, P.: Markov logic networks. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA (2005)
Sanghai, S., Domingos, P., Weld, D.: Relational dynamic Bayesian networks. Journal of Artificial Intelligence Research 24, 1–39 (2005)
Taskar, B., Segal, E., Koller, D.: Probabilistic classification and clustering in relational data. In: IJCAI 2001, Seattle, WA, pp. 870–876 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, XL., Zhou, ZH. (2007). Structure Learning of Probabilistic Relational Models from Incomplete Relational Data. In: Kok, J.N., Koronacki, J., Mantaras, R.L.d., Matwin, S., Mladenič, D., Skowron, A. (eds) Machine Learning: ECML 2007. ECML 2007. Lecture Notes in Computer Science(), vol 4701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74958-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-74958-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74957-8
Online ISBN: 978-3-540-74958-5
eBook Packages: Computer ScienceComputer Science (R0)