k-Optimal: a novel approximate inference algorithm for ProbLog
ProbLog is a probabilistic extension of Prolog. Given the complexity of exact inference under ProbLog’s semantics, in many applications in machine learning approximate inference is necessary. Current approximate inference algorithms for ProbLog however require either dealing with large numbers of proofs or do not guarantee a low approximation error. In this paper we introduce a new approximate inference algorithm which addresses these shortcomings. Given a user-specified parameter k, this algorithm approximates the success probability of a query based on at most k proofs and ensures that the calculated probability p is (1−1/e)p ∗≤p≤p ∗, where p ∗ is the highest probability that can be calculated based on any set of k proofs. Furthermore a useful feature of the set of calculated proofs is that it is diverse. Our experiments show the utility of the proposed algorithm.
- Bryant, R. E. (1986). Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35, 677–691. CrossRef
- De Raedt, L., Kimmig, A., & Toivonen, H. (2007). Problog: a probabilistic prolog and its application in link discovery. In IJCAI (pp. 2462–2467).
- De Raedt, L., Kimmig, A., Gutmann, B., Kersting, K., Costa, V. S., & Toivonen, H. (2010). Inductive Databases and Constraint-Based Data Mining (pp. 229–262).
- Gutmann, B., Kimmig, A., De Raedt, L., & Kersting, K. (2008). Parameter learning in probabilistic databases: a least squares approach. In ECML PKDD (Vol. 5211/2008, pp. 473–488).
- Gutmann, B., Thon, I., & De Raedt, L. (2011). Learning the parameters of probabilistic logic programs from interpretations. In ECML PKDD (Vol. 6911/2011, pp. 581–596).
- Hazan, E., Safra, S., & Schwartz, O. (2006). On the complexity of approximating k-set packing. Computational Complexity, 15, 20–39. CrossRef
- Ourfali, O., Shlomi, T., Ideker, T., Ruppin, E., & Sharan, R. (2007). Spine: a framework for signaling-regulatory pathway inference from cause-effect experiments. Bioinformatics, 23, 359–366. CrossRef
- Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In International conference on logic programming (pp. 715–729). Cambridge: MIT Press.
- Van den Broeck, G., Thon, I., van Otterlo, M., & De Raedt, L. (2010). DTProbLog: a decision-theoretic probabilistic prolog. In AAAI (pp. 1217–1222).
- k-Optimal: a novel approximate inference algorithm for ProbLog
Volume 89, Issue 3 , pp 215-231
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- Inductive logic programming
- Statistical relational learning
- Decision theory
- Approximative inference
- Industry Sectors