Computing marginal distributions over continuous Markov networks for statistical relational learning

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Bröcheler, Matthias ^a   Getoor, Lise ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; PROBABILITY DISTRIBUTIONS;

ITS EFFICIENCIES; JOINT PROBABILITY DISTRIBUTIONS; MARGINAL DISTRIBUTION; MARKOV NETWORKS; MARKOV RANDOM FIELDS; NOVEL TECHNIQUES; POLYNOMIAL TIME APPROXIMATION SCHEMES; RANDOM FIELDS; SAMPLING ALGORITHM; STATISTICAL RELATIONAL LEARNING;

MARKOV PROCESSES;

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

References (13)

1. E. B Sudderth. Graphical models for visual object recognition and tracking. Ph.D. thesis, Massachusetts Institute of Technology, 2006.
2. L. Lovasz and S. Vempala. Hit-and-run from a corner. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 310-314, Chicago, IL, USA, 2004. ACM.
3. M. Broecheler, L. Mihalkova, and L. Getoor. Probabilistic similarity logic. In Conference on Uncertainty in Artificial Intelligence, 2010.
4. M. Richardson and P. Domingos. Markov logic networks. Machine Learning, 62(1):107-136, 2006.
5. K. Kersting and L. De Raedt. Bayesian logic programs. Technical report, Albert-Ludwigs University, 2001.
6. B. Taskar, P. Abbeel, and D. Koller. Discriminative probabilistic models for relational data. In Proceedings of UAI-02, 2002.
7. M. Broecheler, G. Simari, and VS. Subrahmanian. Using histograms to better answer queries to probabilistic logic programs. Logic Programming, page 4054, 2009.
8. M. E. Dyer and A. M. Frieze. On the complexity of computing the volume of a polyhedron. SIAM Journal on Computing, 17(5):967-974, October 1988.
9. R. Kannan, L. Lovasz, and M. Simonovits. Random walks and an o*(n5) volume algorithm for convex bodies. Random structures and algorithms, 11(1):150, 1997.
10. R. L. Smith. Efficient monte carlo procedures for generating points uniformly distributed over bounded regions. Operations Research, 32(6):1296-1308, 1984.
11. S. Agmon. The relaxation method for linear inequalities. Canadian Journal of Mathematics, 6(3):382392, 1954.
12. T. S. Motzkin and I. J. Schoenberg. The relaxation method for linear inequalities. IJ Schoenberg: Selected Papers, page 75, 1988.
13. P. Sen, G. Namata, M. Bilgic, L. Getoor, B. Galligher, and T. Eliassi-Rad. Collective classification in network data. AI Magazine, 29(3):93, 2008.