Abstract
A new method is proposed for compiling causal independencies into Markov logic networks (MLNs). An MLN can be viewed as compactly representing a factorization of a joint probability into the product of a set of factors guided by logical formulas. We present a notion of causal independence that enables one to further factorize the factors into a combination of even smaller factors and consequently obtain a finer-grain factorization of the joint probability. The causal independence lets us specify the factor in terms of weighted, directed clauses and operators, such as “or”, “sum” or “max”, on the contribution of the variables involved in the factors, hence combining both undirected and directed knowledge. Our experimental evaluations shows that making use of the finer-grain factorization provided by causal independence can improve quality of parameter learning in MLNs.
Chapter PDF
Similar content being viewed by others
Keywords
- Bayesian Network
- Integrity Constraint
- Directed Model
- Conditional Probability Distribution
- Combination Function
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
Domingos, P., Lowd, D.: Markov Logic: An Interface Layer for AI. Morgan & Claypool, San Rafael (2009)
Fierens, D., Blockeel, H., Bruynooghe, M., Ramon, J.: Logical Bayesian networks and their relation to other probabilistic logical models. In: Kramer, S., Pfahringer, B. (eds.) ILP 2005. LNCS (LNAI), vol. 3625, pp. 121–135. Springer, Heidelberg (2005)
Getoor, L., Friedman, N., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Dzeroski, S., Lavrac, N. (eds.) Relational Data Mining (2001)
Getoor, L., Grant, J.: PRL: A probabilistic relational language. Mach. Learn. 62(1-2), 7–31 (2006)
Getoor, L., Taskar, B.: Introduction to Statistical Relational Learning. MIT Press, Cambridge (2007)
Heckerman, D., Breese, J.: A new look at causal independence. In: UAI (1994)
Jaeger, M.: Relational Bayesian networks. In: Proceedings of UAI (1997)
Jaeger, M.: Parameter learning for Relational Bayesian networks. In: ICML (2007)
Jaeger, M.: Model-theoretic expressivity analysis. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S.H. (eds.) Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 325–339. Springer, Heidelberg (2008)
Kersting, K., De Raedt, L.: Bayesian logic programming: Theory and tool. An Introduction to Statistical Relational Learning (2007)
Kok, S., Sumner, M., Richardson, M., Singla, P., Poon, H., Lowd, D., Domingos, P.: The Alchemy system for statistical relational AI. Technical report, Department of Computer Science and Engineering, University of Washington, Seattle, WA (2007)
Koller, D., Pfeffer, A.: Learning probabilities for noisy first-order rules. In: IJCAI (1997)
Natarajan, S., Tadepalli, P., Dietterich, T.G., Fern, A.: Learning first-order probabilistic models with combining rules. Special Issue on Probabilistic Relational Learning, AMAI (2009)
Zhang, N., Poole, D.: Exploiting causal independence in Bayesian network inference. JAIR 5, 301–328 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Natarajan, S., Khot, T., Lowd, D., Tadepalli, P., Kersting, K., Shavlik, J. (2010). Exploiting Causal Independence in Markov Logic Networks: Combining Undirected and Directed Models. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2010. Lecture Notes in Computer Science(), vol 6322. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15883-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-15883-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15882-7
Online ISBN: 978-3-642-15883-4
eBook Packages: Computer ScienceComputer Science (R0)