×

zbMATH — the first resource for mathematics

Lifted graphical models: a survey. (English) Zbl 1320.62016
Summary: Lifted graphical models provide a language for expressing dependencies between different types of entities, their attributes, and their diverse relations, as well as techniques for probabilistic reasoning in such multi-relational domains. In this survey, we review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We discuss inference algorithms, including lifted inference algorithms, that efficiently compute the answers to probabilistic queries over such models. We also review work in learning lifted graphical models from data. There is a growing need for statistical relational models (whether they go by that name or another), as we are inundated with data which is a mix of structured and unstructured, with entities and relations extracted in a noisy manner from text, and with the need to reason effectively with this data. We hope that this synthesis of ideas from many different research groups will provide an accessible starting point for new researchers in this expanding field.

MSC:
62B10 Statistical aspects of information-theoretic topics
94C15 Applications of graph theory to circuits and networks
68T05 Learning and adaptive systems in artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ahmadi, B., Kersting, K., Sanner, S. (2011). Multi-evidence lifted message passing, with application to PageRank and the Kalman filter. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11).
[2] Ahmadi, B., Kersting, K., Natarajan, S. (2012). Lifted online training of relational models with stochastic gradient methods. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-12).
[3] Ahmadi, B; Kersting, K; Mladenov, M; Natarajan, S, Exploiting symmetries for scaling loopy belief propagation and relational training, Machine Learning, 92, 91-132, (2013) · Zbl 1273.68293
[4] Airoldi, EM; Blei, DM; Fienberg, SE; Xing, EP, Mixed membership stochastic blockmodels, Journal of Machine Learning Research, 9, 1981-2014, (2008) · Zbl 1225.68143
[5] Apsel, U., Brafman, R. I. (2011). Extended lifted inference with joint formulas. In: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI-11).
[6] Arora, N. S., de Salvo Braz, R., Sudderth, E. B., & Russell, S. J. (2010). Gibbs sampling in open-universe stochastic languages. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI-10).
[7] Bach, S. H., Broecheler, M., Getoor, L., & O’Leary, D. P. (2012). Scaling MPE inference for constrained continuous Markov random fields with consensus optimization. In: Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS-12).
[8] Bach, S. H., Huang, B., London, B., & Getoor, L. (2013). Hinge-loss Markov random fields: Convex inference for structured prediction. In: Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (UAI-13).
[9] Bakir, G. H., Hofmann, T., Schölkopf, B., Smola, A. J., Taskar, B., & Vishwanathan, S. V. N. (Eds.). (2007). Predicting structured data. Cambridge: MIT Press.
[10] Banerjee, B., Liu, Y. & Youngblood, G.M. (eds) (2006). Structural knowledge transfer for machine learning. Workshop at ICML-06.
[11] Besag, J, Statistical analysis of non-lattice data, The Statistician, 24, 179-195, (1975)
[12] Biba, M., Ferilli, S. & Esposito, F. (2008). Discriminative structure learning of Markov logic networks. In: Proceedings of the 18th International Conference on Inductive Logic Programming (ILP-08). · Zbl 1156.68520
[13] Bishop, C. M. (2006). Pattern recognition and machine learning. Heidelberg: Springer. · Zbl 1107.68072
[14] Broecheler, M. & Getoor, L. (2010). Computing marginal distributions over continuous Markov networks for statistical relational learning. In:Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS-10).
[15] Broecheler, M., Mihalkova, L., & Getoor, L. (2010). Probabilistic similarity logic. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI-10).
[16] Bui, H. H., Huynh, T. N., & de Salvo Braz, R. (2012). Exact lifted inference with distinct soft evidence on every object. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI-12).
[17] Bui, H. H., Huynh, T. N., & Riedel, S. (2013). Automorphism groups of graphical models and lifted variational inference. In: Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (UAI-13).
[18] Chang, J. & Blei, D.M. (2009). Relational topic models for document networks. In: Proceedings of the 12th International Conference on Artificial Intelligence and Statistics (AISTATS-09).
[19] Choi, J., & Amir, E. (2012). Lifted relational variational inference. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI-12).
[20] Choi, J., Amir, E., & Hill, D. J. (2010). Lifted inference for relational continuous models. In: Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI-10).
[21] Choi, J., Guzmán-Rivera, A. & Amir, E. (2011a). Lifted relational Kalman filtering. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11).
[22] Choi, J., de Salvo Braz, R. & Bui, H.H. (2011b). Efficient methods for lifted inference with aggregate factors. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-11).
[23] Chu, W., Sindhwani, V., Ghahramani, Z. & Keerthi, S.S. (2006). Relational learning with Gaussian processes. In: Proceedings of the 20th Annual Conference on Neural Information Processing Systems (NIPS-06).
[24] Damien, P; Wakefield, J; Walker, S, Gibbs sampling for Bayesian non-conjugate and hierarchical models by using auxiliary variables, Journal of the Royal Statistical Society, 61, 331-344, (1999) · Zbl 0913.62028
[25] Davis, J. & Domingos, P. (2009). Deep transfer via second-order Markov logic. In: Proceedings of the 26th International Conference on Machine Learning (ICML-09).
[26] De Raedt, L. (1996). Advances in inductive logic programming. Amsterdam: IOS Press. · Zbl 0845.68002
[27] De Raedt, L. (2008). Logical and relational learning. Heidelberg: Springer. · Zbl 1203.68145
[28] Raedt, L; Kersting, K, Probabilistic logic learning, ACM-SIGKDD Explorations, 5, 31-48, (2003)
[29] De Raedt, L. & Kersting, K. (2004). Probabilistic inductive logic programming. In: Proceedings of the 15th International Conference on Algorithmic Learning Theory (ALT-04). · Zbl 1110.68392
[30] Raedt, L; Kersting, K; Sammut, C (ed.); Webb, GI (ed.), Statistical relational learning, (2010), Heidelberg · Zbl 1185.68513
[31] De Raedt, L., Kimmig, A. & Toivonen, H. (2007). ProbLog: A probabilistic Prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07).
[32] De Raedt, L., Frasconi, P., Kersting, K., & Muggleton, S. (Eds.). (2008). Probabilistic inductive logic programming. New York: Springer. · Zbl 1132.68007
[33] de Salvo Braz, R., Amir, E. & Roth, D. (2005). Lifted first-order probabilistic inference. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05). · Zbl 1213.68619
[34] de Salvo Braz, R., Amir, E. & Roth, D. (2006). MPE and partial inversion in lifted probabilistic variable elimination. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06).
[35] Salvo Braz, R; Amir, E; Roth, D; Getoor, L (ed.); Taskar, B (ed.), Lifted first-order probabilistic inference, (2007), Cambridge
[36] Salvo Braz, R; Amir, E; Roth, D; Holmes, DE (ed.); Jain, LC (ed.), A survey of first-order probabilistic models, (2008), Berlin · Zbl 1213.68619
[37] de Salvo Braz, R., Natarajan, S., Bui, H., Shavlik, J., & Russell, S. (2009). Anytime lifted belief propagation. In: Proceedings of the International Workshop on Statistical Relational Learning (SRL-09).
[38] Della Pietra, S., Della Pietra, V. J., & Lafferty, J. D. (1997). Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4), 380-393.
[39] Dietterich, T., Getoor, L. & Murphy, K. (eds) (2004). Statistical relational learning and its connections to other fields (SRL-04).
[40] Domingos, P. & Kersting, K. (eds) (2009). International Workshop on Statistical Relational Learning (SRL-09).
[41] Domingos, P., & Lowd, D. (2009). Markov logic: An interface layer for artificial intelligence. San Rafael: Morgan & Claypool. · Zbl 1202.68403
[42] Dz̆eroski, S., & Lavraz, N. (Eds.). (2001). Relational data mining. Berlin: Springer. · Zbl 1003.68039
[43] Fern, A., Getoor, L. & Milch, B. (eds) (2006). Open problems in statistical relational learning (SRL-06). Workshop at ICML-06.
[44] Friedman, N., Getoor, L., Koller, D. & Pfeffer, A. (1999a). Learning probabilistic relational models. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99).
[45] Friedman, N., Nachman, I., Peér, D. (1999b). Learning Bayesian network structure from massive datasets: The “sparse candidate” algorithm. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99).
[46] Gaudel, R., Sebag, M., Cornuéjols, A. (2007). A phase transition-based perspective on multiple instance kernels. In: Proceedings of the 17th International Conference on Inductive Logic Programming (ILP-07).
[47] Getoor, L. (2002). Learning statistical models from relational data. PhD Thesis, Stanford University.
[48] Getoor, L., & Taskar, B. (Eds.). (2007). Introduction to statistical relational learning. Cambridge: MIT Press. · Zbl 1141.68054
[49] Getoor, L; Friedman, N; Koller, D; Taskar, B, Learning probabilistic models of link structure, Journal of Machine Learning Research, 3, 679-707, (2002) · Zbl 1112.68441
[50] Getoor, L; Friedman, N; Koller, D; Pfeffer, A; Taskar, B; Getoor, L (ed.); Taskar, B (ed.), Probabilistic relational models, (2007), Cambridge
[51] Gogate, V., Domingos, P. (2011). Probabilistic theorem proving. In: Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI-11).
[52] Gogate, V., Jha, A.K. & Venugopal, D. (2012). Advances in lifted importance sampling. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI-12).
[53] Gogate, V., Kersting, K., Natarajan, S. & Poole, D. (eds) (2013). Statistical relational AI Workshop at AAAI-13.
[54] Gomes, T. & Santos Costa, V. (2012). Evaluating inference algorithms for the Prolog factor language. In: Proceedings of the 22nd International Conference on Inductive Logic Programming (ILP-12). · Zbl 1382.68192
[55] Hadiji, F. & Kersting, K. (2013). Reduce and re-lift: Bootstrapped lifted likelihood maximization for MAP. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI-13).
[56] Hadiji, F., Ahmadi, B. & Kersting, K. (2011). Efficient sequential clamping for lifted message passing. In: Proceedings of the 34th Annual German Conference on AI (KI-11).
[57] Heckerman, D; Jordan, M (ed.), A tutorial on learning with Bayesian networks, (1999), Cambridge
[58] Heckerman, D., & Breese, J. S. (1994). A new look at causal independence. In: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI-94).
[59] Heckerman, D; Chickering, DM; Meek, C; Rounthwaite, R; Kadie, C, Dependency networks for inference, collaborative filtering and data visualization, Journal of Machine Learning Research, 1, 49-75, (2000) · Zbl 1008.68132
[60] Huynh, T.N. & Mooney, R.J. (2008). Discriminative structure and parameter learning for Markov logic networks. In: Proceedings of the 25th International Conference on Machine Learning (ICML-08).
[61] Huynh, T. N. & Mooney, R. J. (2009). Max-margin weight learning for Markov logic networks. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-09).
[62] Huynh, T. N. & Mooney, R. J. (2011). Online max-margin weight learning for Markov logic networks. In: Proceedings of the Eleventh SIAM International Conference on Data Mining (SDM-11).
[63] Jaeger, M. (1997). Relational Bayesian networks. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI-97). · Zbl 0945.03543
[64] Jaeger, M. (2002). Relational Bayesian networks: A survey. Linköping Electronic Articles in Computer and Information Science, \(7\)(015), 1-22.
[65] Jaeger, M. (2014). Lower complexity bounds for lifted inference. Theory and Practice of Logic Programming (to appear - available as arXiv:1204.3255v2).
[66] Jaeger, M., Van den Broeck, G. (2012). Liftability of probabilistic inference: Upper and lower bounds. In: Proceedings of the 2nd International Workshop on Statistical Relational AI (StaRAI-12).
[67] Jaimovich, A., Meshi, O., & Friedman, N. (2007). Template based inference in symmetric relational Markov random fields. In: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence (UAI-07).
[68] Jain, D. (2011). Knowledge engineering with Markov logic networks: A review. In: Proceedings of the Third Workshop on Dynamics of Knowledge and Belief (DKB-11).
[69] Jensen, D., Neville, J., & Gallagher, B. (2004). Why collective inference improves relational classification. In: Proceedings of the 10th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-04).
[70] Jha, A., Gogate, V., Meliou, A., & Suciu, D. (2010). Lifted inference seen from the other side: The tractable features. In: Proceedings of the 24th Annual Conference on Neural Information Processing Systems (NIPS-10).
[71] Kautz, H., Selman, B., & Jiang, Y. (1997). A general stochastic approach to solving problems with hard and soft constraints. In: Gu D, Du J, Pardalos P (eds) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol 35, American Mathematical Society, pp 573-586. · Zbl 0891.68100
[72] Kautz, H., Kersting, K., Natarajan, S., & Poole, D. (eds)., (2012). Statistical relational AI Workshop at UAI-12.
[73] Kersting, K. (2012). Lifted probabilistic inference. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI-12).
[74] Kersting, K., & De Raedt, L. (2001). Towards combining inductive logic programming with Bayesian networks. In: Proceedings of the 11th International Conference on Inductive Logic Programming (ILP-01). · Zbl 1006.68518
[75] Kersting, K., Ahmadi, B., & Natarajan, S. (2009). Counting belief propagation. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI-09).
[76] Kersting, K., Massaoudi, Y.E., Hadiji, F., & Ahmadi, B. (2010a). Informed lifting for message-passing. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10).
[77] Kersting, K., Russell, S., Kaelbling, L.P., Halevy, A., Natarajan, S., & Mihalkova, L. (eds) (2010b). Statistical Relational AI Workshop at AAAI-10.
[78] Kersting, K., Poole, D., & Natarajan, S. (2011). Lifted inference in probabilistic logical models. Tutorial at IJCAI-11.
[79] Khosravi, H., Schulte, O., Man, T., Xu, X., & Bina, B. (2010). Structure learning for Markov logic networks with many descriptive attributes. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10).
[80] Khosravi, H; Schulte, O; Hu, J; Gao, T, Learning compact Markov logic networks with decision trees, Machine Learning, 89, 257-277, (2012)
[81] Khot, T., Natarajan, S., Kersting, K., & Shavlik, J. W. (2011). Learning Markov logic networks via functional gradient boosting. In: Proceedings of the 11th IEEE International Conference on Data Mining (ICDM-11). · Zbl 1346.68159
[82] Khot, T., Natarajan, S., Kersting, K., & Shavlik, J. (2013). Learning relational probabilistic models from partially observed data - opening the closed-world assumption. In: Proceedings of the 23rd International Conference on Inductive Logic Programming (ILP-13).
[83] Kiddon, C., & Domingos, P. (2011). Coarse-to-fine inference and learning for first-order probabilistic models. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-11).
[84] Kisyński, J., & Poole, D. (2009a). Constraint processing in lifted probabilistic inference. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI-09).
[85] Kisyński, J., & Poole, D. (2009b). Lifted aggregation in directed first-order probabilistic models. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09).
[86] Kok, S., & Domingos, P. (2005). Learning the structure of Markov logic networks. In: Proceedings of the 22nd International Conference on Machine Learning (ICML-05).
[87] Kok, S., & Domingos, P. (2009). Learning Markov logic network structure via hypergraph lifting. In: Proceedings of the 26th International Conference on Machine Learning (ICML-09).
[88] Kok, S., & Domingos, P. (2010), Learning Markov logic networks using structural motifs. In: Proceedings of the 27th International Conference on Machine Learning (ICML-10).
[89] Koller, D., & Friedman, N. (2009). Probabilistic graphical models: Principles and techniques. Cambridge: MIT Press. · Zbl 1183.68483
[90] Koller, D., & Pfeffer, A. (1997). Object-oriented Bayesian networks. In: Proceedings of the 13th Conference on Uncertainty in Artificial Intelligence (UAI-97).
[91] Koller, D., & Pfeffer, A. (1998). Probabilistic frame-based systems. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98).
[92] Kschischang, FR; Frey, BJ; Loeliger, HA, Factor graphs and the sum-product algorithm, IEEE Transactions on Information Theory, 47, 498-519, (2001) · Zbl 0998.68234
[93] Kuwadekar, A., & Neville, J. (2011). Relational active learning for joint collective classification models. In: Proceedings of the 28th International Conference on Machine Learning (ICML-11).
[94] Lafferty, J., McCallum, A., Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In: Proceedings of the 18th International Conference on Machine Learning (ICML-01).
[95] Lavrac̆, N., & Dz̆eroski, S. (1993). Inductive logic programming: Techniques and applications. New York: Routledge.
[96] Lee, S., Ganapathi, V., & Koller, D. (2006). Efficient structure learning of Markov networks using \(L_1\)-regularization. In: Proceedings of the 20th Annual Conference on Neural Information Processing Systems (NIPS-06).
[97] Li, W.J., Yeung, D.Y., & Zhang, Z. (2009). Probabilistic relational PCA. In: Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS-09).
[98] London, B; Getoor, L; Aggarwal, CC (ed.), Collective classification of network data, (2013), Berlin
[99] Lourenço, HR; Martin, OC; Stützle, T; Glover, FW (ed.); Kochenberger, GA (ed.), Iterated local search, (2003), Berlin · Zbl 1116.90412
[100] Lowd, D. (2012). Closed-form learning of Markov networks from dependency networks. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI-12).
[101] Lowd, D., & Davis, J. (2010). Learning Markov network structure with decision trees. In: Proceedings of the 10th IEEE International Conference on Data Mining (ICDM-10). · Zbl 1317.68173
[102] Lowd, D., & Domingos, P. (2007). Efficient weight learning for Markov logic networks. In: Proceedings of the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD-07). · Zbl 1202.68403
[103] Macskassy, S; Provost, F, Classification in networked data: A toolkit and a univariate case study, Journal of Machine Learning Research, 8, 935-983, (2007)
[104] Maier, M., Taylor, B., Oktay, H., & Jensen, D. (2010). Learning causal models of relational domains. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10).
[105] Maier, M., Marazopoulou, K., Arbour, D., & Jensen, D. (2013). A sound and complete algorithm for learning causal models from relational data. In: Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (UAI-13).
[106] Mansinghka, V., Roy, D., & Goodman, N. (eds) (2012). NIPS workshop on probabilistic programming: Foundations and applications.
[107] McCallum, A., Schultz, K., & Singh, S. (2009). FACTORIE: Probabilistic programming via imperatively defined factor graphs. In: Proceedings of the 23rd Annual Conference on Neural Information Processing Systems (NIPS-09).
[108] Mihalkova, L., & Mooney, R.J. (2007). Bottom-up learning of Markov logic network structure. In: Proceedings of the 24th International Conference on Machine Learning (ICML-07).
[109] Mihalkova, L., & Mooney, R. J. (2009). Transfer learning from minimal target data by mapping across relational domains. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09).
[110] Mihalkova, L., & Richardson, M. (2009). Speeding up inference in statistical relational learning by clustering similar query literals. In: Proceedings of the 19th International Conference on Inductive Logic Programming (ILP-09). · Zbl 1286.68382
[111] Mihalkova, L., Huynh, T., & Mooney, R. J. (2007). Mapping and revising Markov logic networks for transfer learning. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07).
[112] Milch, B., & Russell, S. (2006). General-purpose MCMC inference over relational structures. In: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence (UAI-06).
[113] Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2005). BLOG: probabilistic models with unknown objects. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05).
[114] Milch, B., Zettlemoyer, L.S., Kersting, K., Haimes, M., & Kaelbling, L.P. (2008). Lifted probabilistic inference with counting formulas. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08).
[115] Mladenov, M., Ahmadi, B., & Kersting, K. (2012). Lifted linear programming. In: Proceedings of the 15th International Conference on Artificial Intelligence and Statistics (AISTATS-12).
[116] Mooij, J., & Kappen, B. (2008). Bounds on marginal probability distributions. In: Proceedings of the 22nd Annual Conference on Neural Information Processing Systems (NIPS-08).
[117] Muggleton, S, Inductive logic programming, New Generation Computing, 8, 295-318, (1991) · Zbl 0712.68022
[118] Muggleton, S. (Ed.). (1992). Inductive logic programming. London: Academic Press. · Zbl 0838.68093
[119] Muggleton, S. (1996). Stochastic logic programs. In: Proceedings of the 6th International Workshop on Inductive Logic Programming (ILP-96). · Zbl 1017.68098
[120] Muggleton, S; Raedt, L, Inductive logic programming: theory and methods, Journal of Logic Programming, 19, 629-679, (1994) · Zbl 0816.68043
[121] Munoz, D., Bagnell, J., Vandapel, N., & Hebert, M. (2009). Contextual classification with functional max-margin Markov networks. In: Proceedings of the 22nd IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR-09).
[122] Murphy, K. P., Weiss, Y., & Jordan, M. I. (1999). Loopy belief propagation for approximate inference: An empirical study. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99).
[123] Natarajan, S., Khot, T., Lowd, D., Kersting, K., Tadepalli, P., & Shavlik, J. (2010). Exploiting causal independence in Markov logic networks: combining undirected and directed models. In: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-10).
[124] Natarajan, S; Khot, T; Kersting, K; Gutmann, B; Shavlik, JW, Gradient-based boosting for statistical relational learning: the relational dependency network case, Machine Learning, 86, 25-56, (2012) · Zbl 1243.68245
[125] Nath, A., & Domingos, P. (2010). Efficient lifting for online probabilistic inference. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI-10).
[126] Nath, A., & Richardson, M. (2012). Counting-MLNs: Learning relational structure for decision making. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI-12).
[127] Neville, J; Jensen, D, Relational dependency networks, Journal of Machine Learning Research, 8, 653-692, (2007) · Zbl 1222.68274
[128] Niepert, M. (2012). Markov chains on orbits of permutation groups. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI-12).
[129] Niepert, M. (2013). Symmetry-aware marginal density estimation. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI-13).
[130] Noessner, J., Niepert, M., & Stuckenschmidt, H. (2013). RockIt: Exploiting parallelism and symmetry for MAP inference in statistical relational models. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI-13).
[131] Odersky, M., Altherr, P., Cremet, V., Emir, B., Maneth, S., Micheloud, S., Mihaylov, N., Schinz, M., Stenman, E., & Zenger, M. (2004). An overview of the Scala programming language. Tech. Rep. IC/2004/64, EPFL Lausanne, Switzerland.
[132] Van Otterlo, M. (2009). The logic of adaptive behavior—knowledge representation and algorithms for adaptive sequential decision making under uncertainty in first-order and relational domains. Amsterdam: IOS Press. · Zbl 1185.68685
[133] Paes, A., Revoredo, K., Zaverucha, G., & Santos Costa, V. (2005). Probabilistic first-order theory revision from examples. In: Proceedings of the 15th International Conference on Inductive Logic Programming (ILP-05). · Zbl 1134.68550
[134] Pearl, J. (1988). Probabilistic reasoning in intelligent systems: networks of plausible inference. San Mateo: Morgan Kaufmann. · Zbl 0746.68089
[135] Pearl, J. (2009). Causality: Models, reasoning and inference (2nd ed.). New York: Cambridge University Press. · Zbl 1188.68291
[136] Perlich, C., & Provost, F. J. (2003). Aggregation-based feature invention and relational concept classes. In: Proceedings of the 9th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD-03).
[137] Pfeffer, A. (2007). Sampling with memoization. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07).
[138] Pfeffer, A., Koller, D., Milch, B., & Takusagawa, K. T. (1999). SPOOK: A system for probabilistic object-oriented knowledge representation. In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99).
[139] Poole, D. (2003). First-order probabilistic inference. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03).
[140] Poole, D; Zhang, NL, Exploiting contextual independence in probabilistic inference, Journal of Artificial Intelligence Research, 18, 263-313, (2003) · Zbl 1056.68144
[141] Poon, H., & Domingos, P. (2006). Sound and efficient inference with probabilistic and deterministic dependencies. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06).
[142] Poon, H., Domingos, P., & Sumner, M. (2008). A general method for reducing the complexity of relational inference and its application to MCMC. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08).
[143] Quinlan, JR, Learning logical definitions from relations, Machine Learning, 5, 239-266, (1990)
[144] Rabiner, LR, A tutorial on hidden Markov models and selected applications in speech recognition, Proceedings of the IEEE, 77, 257-286, (1989)
[145] Rattigan, M. J., Maier, M. E., & Jensen, D. (2011). Relational blocking for causal discovery. In: Proceedings of the 25th AAAI Conference on Artificial Intelligence (AAAI-11).
[146] Richards, B. L., & Mooney, R. J. (1992). Learning relations by pathfinding. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92).
[147] Richards, BL; Mooney, RJ, Automated refinement of first-order Horn-clause domain theories, Machine Learning, 19, 95-131, (1995)
[148] Richardson, M; Domingos, P, Markov logic networks, Machine Learning, 62, 107-136, (2006)
[149] Riedel, S. (2008). Improving the accuracy and efficiency of MAP inference for Markov logic. In: Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI-08).
[150] Roy, D., Mansinghka, V., Winn, J., McAllester, D., & Tenenbaum, J. (eds) (2008). NIPS workshop on probabilistic programming: universal languages and inference; systems; and applications.
[151] Sarkhel, S., Venugopal, D., Singla, P., & Gogate, V. (2014). Lifted MAP inference for Markov Logic Networks. In: Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS-14).
[152] Schulte, O. (2011). A tractable pseudo-likelihood function for Bayes nets applied to relational data. In: Proceedings of the Eleventh SIAM International Conference on Data Mining (SDM-11).
[153] Schulte, O; Khosravi, H, Learning graphical models for relational data via lattice search, Machine Learning, 88, 331-368, (2012)
[154] Schulte, O; Khosravi, H; Man, T, Learning directed relational models with recursive dependencies, Machine Learning, 89, 299-316, (2012) · Zbl 1260.68343
[155] Sen, P., Deshpande, A., & Getoor, L. (2008a). Exploiting shared correlations in probabilistic databases. In: Proceedings of the 34th International Conference on Very Large Data Bases (VLDB-08).
[156] Sen, P; Namata, GM; Bilgic, M; Getoor, L; Gallagher, B; Eliassi-Rad, T, Collective classification in network data, AI Magazine, 29, 93-106, (2008)
[157] Sen, P., Deshpande, A., & Getoor, L. (2009). Bisimulation-based approximate lifted inference. In: Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI-09).
[158] Shavlik, J., & Natarajan, S. (2009). Speeding up inference in Markov logic networks by preprocessing to reduce the size of the resulting grounded network. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09).
[159] Singla, P., & Domingos, P. (2005). Discriminative training of Markov logic networks. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05).
[160] Singla, P., & Domingos, P. (2006). Memory-efficient inference in relational domains. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06).
[161] Singla, P., & Domingos, P. (2008). Lifted first-order belief propagation. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08).
[162] Spirtes, P., Glymour, C., & Scheines, R. (2001). Causation, prediction, and search. Cambridge: MIT Press. · Zbl 0806.62001
[163] Srinivasan, A. (2001). The Aleph manual. http://web.comlab.ox.ac.uk/oucl/research/areas/machlearn/Aleph/
[164] Suciu, D., Olteanu, D., Ré, C., & Koch, C. (2011). Probabilistic databases. Synthesis lectures on data management. San Rafael: Morgan & Claypool.
[165] Taghipour, N., Fierens, D., Davis, J., & Blockeel, H. (2012). Lifted variable elimination with arbitrary constraints. In: Proceedings of the 15th International Conference on Artificial Intelligence and Statistics (AISTATS-12). · Zbl 1272.68397
[166] Taghipour, N., Davis, J., & Blockeel, H. (2013a). First-order decomposition trees. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NIPS-13).
[167] Taghipour, N; Fierens, D; Davis, J; Blockeel, H, Lifted variable elimination: decoupling the operators from the constraint language, Journal of Artificial Intelligence Research, 47, 393-439, (2013) · Zbl 1272.68397
[168] Taghipour, N., Fierens, D., Van den Broeck, G., Davis, J., & Blockeel, H. (2013c). Completeness results for lifted variable elimination. In: Proceedings of the 16th International Conference on Artificial Intelligence and Statistics (AISTATS-13). · Zbl 1272.68397
[169] Taskar, B. (2004). Learning structured prediction models: A large margin approach. PhD Thesis, Stanford University.
[170] Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. In: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI-02).
[171] Taskar, B., Guestrin, C., & Koller, D. (2003). Max-margin Markov networks. In: Proceedings of the 17th Annual Conference on Neural Information Processing Systems (NIPS-03).
[172] Taskar, B., Chatalbashev, V., & Koller, D. (2004). Learning associative Markov networks. In: Proceedings of the 21st International Conference on Machine Learning (ICML-04).
[173] Tierney, L, Markov chains for exploring posterior distributions, Annals of Statistics, 22, 1701-1728, (1994) · Zbl 0829.62080
[174] Tsochantaridis, I., Hofmann, T., Joachims, T., & Altun, Y. (2004). Support vector machine learning for interdependent and structured output spaces. In: Proceedings of the 21st International Conference on Machine Learning (ICML-04). · Zbl 1222.68321
[175] Van den Broeck, G. (2011). On the completeness of first-order knowledge compilation for lifted probabilistic inference. In: Proceedings of the 25th Annual Conference on Neural Information Processing Systems (NIPS-11).
[176] Van den Broeck, G., & Darwiche, A. (2013). On the complexity and approximation of binary evidence in lifted inference. In: Proceedings of the 27th Annual Conference on Neural Information Processing Systems (NIPS-13).
[177] Van den Broeck, G., & Davis, J. (2012). Conditioning in first-order knowledge compilation and lifted probabilistic inference. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI-12).
[178] Van den Broeck, G., Taghipour, N., Meert, W., Davis, J., & De Raedt, L. (2011). Lifted probabilistic inference by first-order knowledge compilation. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI-11).
[179] Van den Broeck, G., Choi, A., & Darwiche, A. (2012). Lifted relax, compensate and then recover: From approximate to exact lifted probabilistic inference. In: Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI-12).
[180] Van den Broeck, G., Meert, W., & Darwiche, A. (2014). Skolemization for weighted first-order model counting. In: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR-14).
[181] Venugopal, D., & Gogate, V. (2012). On lifting the Gibbs sampling algorithm. In: Proceedings of the 26th Annual Conference on Neural Information Processing Systems (NIPS-12).
[182] Wainwright, MJ; Jaakkola, T; Willsky, AS, MAP estimation via agreement on trees: message-passing and linear programming, IEEE Transactions on Information Theory, 51, 3697-3717, (2005) · Zbl 1318.94025
[183] Wang, J., & Domingos, P. (2008). Hybrid Markov logic networks. In: Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08).
[184] Wei, W., Erenrich, J., & Selman, B. (2004). Towards efficient sampling: Exploiting random walk strategies. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04).
[185] Weiss, D., & Taskar, B. (2010). Structured prediction cascades. In: Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS-10).
[186] Wellman, MP; Breese, JS; Goldman, RP, From knowledge bases to decision models, Knowledge Engineering Review, 7, 35-53, (1992)
[187] Wu, M., & Schölkopf, B. (2007). Transductive classification via local learning regularization. In: Proceedings of the 11th International Conference on Artificial Intelligence and Statistics (AISTATS-07).
[188] Xu, Z., Kersting, K., & Tresp, V. (2009). Multi-relational learning with Gaussian processes. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI-09).
[189] Yanover, C; Meltzer, T; Weiss, Y, Linear programming relaxations and belief propagation—an empirical study, Journal of Machine Learning Research, 7, 1887-1907, (2006) · Zbl 1222.90033
[190] Yedidia, J. S., Freeman, W. T., & Weiss, Y. (2001). Understanding belief propagation and its generalizations. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01).
[191] Zhang, N. L., & Poole, D. (1994). A simple approach to Bayesian network computations. In: Proccedings of the Tenth Canadian Artificial Intelligence Conference.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.