Bisimulation-based approximate lifted inference

Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, UAI 2009

Volumn , Issue , 2009, Pages 496-505

  Sen, Prithviraj ^a   Deshpande, Amol ^a   Getoor, Lise ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL EFFICIENCY; ECONOMIC AND SOCIAL EFFECTS;

FIRST-ORDER MODELS; GRAPH-THEORETIC; INFERENCE ALGORITHM; INFERENCE TECHNIQUES; ORDERS OF MAGNITUDE; PROBABILISTIC MODELING; SYNTHETIC AND REAL DATA; TUNABLE PARAMETER;

INFERENCE ENGINES;

EID: 80053148228     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. http://www.cs.umass.edu/~mccallum/data/cora-refs.tar.gz.
2. J. Bar-Ilan, G. Kortsarz, and D. Peleg. How to allocate network centers. Journal of Algorithms, 1993.
3. R. de Salvo Braz, E. Amir, and D. Roth. Lifted first-order probabilistic inference. In IJCAI, 2005.
4. R. de Salvo Braz, E. Amir, and D. Roth. MPE and partial inversion in lifted probabilistic variable elimination. In AAAI, 2006.
5. R. Dechter and I. Rish. Mini-buckets: A general scheme for bounded inference. Journal of the ACM, 2003.
6. U. Feige. A threshold of ln(n) for approximating set cover. Journal of the ACM, 1998.
7. M. Garey and D. Johnson. Computers and Intractability: A guide to the theory of NP-Completeness. W.H.Freeman, '79.
8. L. Getoor and B. Taskar, editors. Introduction to Statistical Relational Learning. MIT Press, 2007.
9. C. Giles, K. Bollacker, and S. Lawrence. Citeseer: An automatic indexing system. ACM Digital Libraries, 1998.
10. D. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 1985.
11. P. Kanellakis and S. Smolka. CCS expressions, finite state processes and three problems of equivalence. In PODC, '83.
12. O. Kariv and S. Hakimi. An algorithmic approach to network location problems I: The p-centers. SIAM Journal on Applied Mathematics, 1979.
13. U. Kjaerulff. Graph triangulation: Algorithms giving small total state space. Technical report, Univ. of Aalborg, 1990.
14. A. McCallum, K. Nigam, J. Rennie, and K. Seymore. Automating the construction of internet portals with machine learning. Information Retrieval Journal, 2000.
15. B. Milch, L. Zettlemoyer, K. Kersting, M. Haimes, and L. Kaelbling. Lifted probabilistic inference with counting formulas. In AAAI, 2008.
16. A. Pfeffer, D. Koller, B. Milch, and K. Takusagawa. SPOOK: A system for probabilistic object-oriented knowledge representation. In UAI, 1999.
17. D. Poole. First-order probabilistic inference. In IJCAI, '03.
18. P. Sen, A. Deshpande, and L. Getoor. Exploiting shared correlations in probabilistic databases. In VLDB, 2008.
19. P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Gallagher, and T. Eliassi-Rad. Collective classification in network data. AI Magazine, 29(3), 2008.
20. P. Singla and P. Domingos. Lifted first-order belief propagation. In AAAI, 2008.
21. V. Vazirani. Approximation Algorithms. Springer, 2001.
22. J. Yedidia, W. Freeman, and Y. Weiss. Generalized belief propagation. In NIPS, 2000.
23. N. Zhang and D. Poole. A simple approach to bayesian network computations. In Canadian Conference on AI, 1994.