Sound and efficient inference with probabilistic and deterministic dependencies

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 458-463

  Poon, Hoifung ^a   Domingos, Pedro ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); MARKOV PROCESSES; PROBABILISTIC LOGICS; PROBLEM SOLVING; REAL TIME SYSTEMS; STATISTICAL METHODS;

DETERMINISTIC DEPENDENCIES; GIBBS SAMPLING; INFERENCE ALGORITHMS; STATISTICAL RELATIONAL LEARNING;

LEARNING SYSTEMS;

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

References (19)

1. Allen, D. & Darwiche, A. 2003. New advances in inference by recursive conditioning. In UAI-03.
2. Bartels, C. & Bilmes, J. 2004. Elimination is not enough: Nonminimal triangulations for graphical models. Technical report UWEETR-2004-00010, Univ. of Washington.
3. Damien, P.; Wakefleld, J.; Walker, S. 1999. Gibbs sampling for Bayesian non-conjugate and hierarchical models by auxiliary variables. Journal of the Royal Statistical Society B, 61:2.
4. Dechter, R. & Mateescu, R. 2004. Mixtures of deterministicprobabilistic nets and their search space. In UAI-04.
5. Dietterich, T.; Getoor, L.; Murphy, K., eds. 2004. Proc. ICML-2004 Workshop on Statistical Relational Learning and its Connections to Other Fields. IMLS.
6. Gilks, W. R.; Richardson, S.; Spiegelhalter, D. J., eds. 1996. Markov Chain Monte Carlo in Practice. Chapman and Hall.
7. Kautz, H.; Selman, B.; Jiang, Y. 1997. A general stochastic approach to solving problems with hard and soft constraints. In The Satisfiability Problem: Theory and Applications. AMS.
8. Kok, S.; Singla, P.; Richardson, M.; Domingos, P. 2005. The Alchemy system for statistical relational AI. http://www.cs.washington.edu/ai/alchemy/.
9. Marinari, E., and Parisi, G. 1992. Simulated tempering: A new Monte Carlo scheme. Europhysics Letters, 19, 451-458.
10. McCallum, A.; Nigam, K.; Ungar, L. 2000. Efficient clustering of high-dimensional data sets with application to reference matching. In KDD-00.
11. McCallum, A. & Wellner, B. 2005. Conditional models of identity uncertainty with application to noun coreference. In NIPS-04.
12. Park, J. 2002. Using weighted MAX-SAT engines to solve MPE. In AAA1-02.
13. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.
14. Richardson, M. & Domingos, P. 2006. Markov logic networks. Machine Learning 62:107-136.
15. Roth, D. 1996. On the hardness of approximate reasoning. Artificial Intelligence 82:273-302.
16. Selman, B.; Kautz, H.; Cohen, B. 1996. Local search strategies for satisfiability testing. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. AMS.
17. Singla, P. & Domingos, P. 2005. Discriminative training of Markov logic networks. In AAAI-05.
18. Yedidia, J. S.; Freeman, W. T.; Weiss, Y. 2001. Generalized belief propagation. In NIPS-01.
19. Wei, W.; Erenrich, J.; Selman, B. 2004. Towards efficient sampling: Exploiting random walk strategies. In AAAI-04.