• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Markov Logic Networks (2006)

Cached

  • Download as a PDF

Download Links

  • [www.cs.umass.edu]
  • [www.cs.utexas.edu]
  • [www.cs.washington.edu]
  • [alchemy.cs.washington.edu]
  • [research.microsoft.com]
  • [ai.cs.washington.edu]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.cs.washington.edu]
  • [www.ics.uci.edu]
  • [www.cs.washington.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Matthew Richardson , Pedro Domingos
Venue:Machine Learning
Citations:363 - 27 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Richardson06markovlogic,
    author = {Matthew Richardson and Pedro Domingos},
    title = {Markov Logic Networks},
    booktitle = {Machine Learning},
    year = {2006},
    pages = {2006}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

Abstract. We propose a simple approach to combining first-order logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a first-order knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the domain, it specifies a ground Markov network containing one feature for each possible grounding of a first-order formula in the KB, with the corresponding weight. Inference in MLNs is performed by MCMC over the minimal subset of the ground network required for answering the query. Weights are efficiently learned from relational databases by iteratively optimizing a pseudo-likelihood measure. Optionally, additional clauses are learned using inductive logic programming techniques. Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach.

Citations

5664 Probabilistic Reasoning in Intelligent Systems - Pearl - 1988
1739 Foundations of Logic Programming - Lloyd - 1984
1242 Numerical Optimization - Nocedal, Wright - 1999
1162 Social Network Analysis: Methods and Applications - Wasserman, Faust - 1994
962 Efficient induction of logic programs - Muggleton, Feng - 1990
829 A Machine–oriented Logic Based on the Resolution Principle - Robinson - 1965
752 Learning Bayesian networks: the combination of knowledge and statistical data - Heckerman, Geiger, et al. - 1995
742 Constraint logic programming - JAFFAR, LASSEZ - 1987
486 Pazzani M: On the optimality of the simple Bayesian classifier under zero-one loss - Domingos - 1997
464 Inducing Features of Random Fields - Pietra, Pietra, et al. - 1997
426 D.: Markov chain Monte Carlo in practice - Gilks, Richardson, et al. - 1996
421 Learning probabilistic relational models - Friedman, Getoor, et al. - 1999
419 Probability and statistics - Degroot - 1989
355 Probabilistic logic - Nilsson - 1986
340 BDiscriminative training methods for hidden Markov models - Collins
326 Enhanced hypertext categorization using hyperlinks - Chakrabarti, Dom, et al. - 1998
312 On the limited memory BFGS method for large scale optimization - Liu, Nocedal - 1989
308 Y: Generalized belief propagation - Yedidia, Freeman, et al.
276 D: Discriminative probabilistic models for relational data - Taskar, Abbeel, et al. - 2002
255 Probabilistic Horn abduction and Bayesian networks - Poole - 1993
239 An analysis of first-order logics of probability - Halpern - 1990
225 Representing Reasoning with Probabilistic Knowledge - Bacchus - 1990
213 Operations for learning with graphical models - Buntine - 1994
197 Statistical analysis of non-lattice data - Besag - 1975
195 Logical Foundations of Artificial Intelligence - Genesereth, Nilsson - 1987
188 Efficient Identification of Web Communities - Flake, Lawrence, et al. - 2000
178 On the hardness of approximate reasoning - Roth - 1996
176 A limited memory algorithm for bound constrained optimization - Byrd, Lu, et al. - 1995
172 WE: The state of record linkage and current research problems - Winkler - 1999
170 Clausal discovery - Raedt, Dehaspe - 1997
167 Monte Carlo Maximum Likelihood for Depend Data - Geyer
140 The utility of knowledge in inductive learning - Pazzani, Kibler - 1992
133 Knowledge-based artificial neural networks - Towell, Shavlik - 1994
122 Generalization of the Fortuin-Kasteleyn-SwendsenWang representation and Monte Carlo algorithm - Edwards, Sokal - 1988
122 K.: Dependency Networks for Inference, Collaborative Filtering, and Data Visualization - Heckerman, Chickering, et al.
110 Theory refinement combining analytical and empirical methods. Artificial Intelligence 66:311--344 - Ourston, Mooney - 1994
104 From statistical knowledge bases to degrees of belief - Bacchus, Grove, et al. - 1996
104 Inductive logic programming: Techniques and applications - Lavrac, Dzeroski - 1994
89 First-order probabilistic inference - Poole - 2003
86 Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171:147–177 - Ngo, Haddawy - 1977
68 Raedt. Towards combining inductive logic programming with Bayesian networks - Kersting, de - 2001
58 From knowledge bases to decision models - Wellman, Breese, et al. - 1992
49 Collective Classification with Relational Dependency Networks - Neville, Jensen - 2003
47 P.: Multi-relational record linkage - Parag - 2004
41 Approximate inference for first-order probabilistic languages - Pasula, Russell - 2001
41 Dynamic probabilistic relational models - Sanghai, Domingos, et al. - 2003
37 A general stochastic approach to solving problems with hard and soft constraints. The Satisfiability Problem: Theory and Applications - Kautz, Selman, et al. - 1997
37 Clp(n): Constraint logic programming for probabilistic knowledge - Costa, Page, et al. - 2008
35 Maximum entropy modeling with clausal constraints - Dehaspe - 1997
30 Loglinear models for first-order probabilistic reasoning - CUSSENS - 1999
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University