Bottom-up learning of Markov logic network structure
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current state-of-the-art algorithm for learning MLN structure follows a top-down paradigm where many potential candidate structures are systematically generated without considering the data and then evaluated using a statistical measure of their fit to the data. Even though this existing algorithm outperforms an impressive array of benchmarks, its greedy search is susceptible to local maxima or plateaus. We present a novel algorithm for learning MLN structure that follows a more bottom-up approach to address this problem. Our algorithm uses a "propositional" Markov network learning method to construct "template" networks that guide the construction of candidate clauses. Our algorithm significantly improves accuracy and learning time over the existing topdown approach in three real-world domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676 · cited 18×
“Markov logic networks (MLNs) are a recently developed statistical relational model that generalizes both full .rst-order logic and Markov networks (Richardson & Domingos, 2006).”
BackgroundMethodInfluentialLearning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644 · cited 2×
“programs (Quinlan, 1990) and graphical models (Heckerman, 1995), they take a top-down approach, heuristically searching the space of increasingly complex models, guiding the search by scoring models using a statistical measure of their fit to the training data.”
MethodMuggleton, S. (1995) · New Generation Computing · doi:10.1007/bf03037227 · Cited by 1,411
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Cited by
Markov Logic: An Interface Layer for Artificial Intelligence
Domingos, P., & Lowd, D. (2009) · Synthesis lectures on artificial intelligence and machine learning · doi:10.2200/s00206ed1v01y200907aim007 · Cited by 314
Tuffy: scaling up statistical inference in Markov logic networks using an RDBMS
Niu, F., Ré, C., Doan, A., & Shavlik, J. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/1978665.1978669 · Cited by 251
“Mihalkova and Mooney [35] also employ a bottom-up approach, but they address structure learning of MLNs whereas we focus on inference.”
BackgroundSemantic-based regularization for learning and inference
Diligenti, M., Gori, M., & Saccà, C. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2015.08.011 · Cited by 162
Structure Learning via Parameter Learning
Wang, W. Y., Mazaitis, K., & Cohen, W. W. (2014) · Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management · doi:10.1145/2661829.2662022 · Cited by 47
Learning Relational Representations with Auto-encoding Logic Programs
Dumancic, S., Guns, T., Meert, W., & Blockeel, H. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/842 · Cited by 27
Metadata
- Authors
- Mihalkova, L., & Mooney, R. J.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 625-632
- OpenAlex
- W2144429462
- Cited by
- 169
- References
- 4
- FWCI
- 8.89
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.