The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Statistical predicate invention
Abstract
We propose statistical predicate invention as a key problem for statistical relational learning. SPI is the problem of discovering new concepts, properties and relations in structured data, and generalizes hidden variable discovery in statistical models and predicate invention in ILP. We propose an initial model for SPI based on second-order Markov logic, in which predicates as well as arguments can be variables, and the domain of discourse is not fully known in advance. Our approach iteratively refines clusters of symbols based on the clusters of symbols they appear in atoms with (e.g., it clusters relations by the clusters of the objects they relate). Since different clusterings are better for predicting different subsets of the atoms, we allow multiple cross-cutting clusterings. We show that this approach outperforms Markov logic structure learning and the recently introduced infinite relational model on a number of relational datasets.
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
(1988) · Cited by 16,582
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Self-citationIntroduction to Statistical Relational Learning
(2007) · doi:10.7551/mitpress/7432.001.0001 · Cited by 1,643
Information-theoretic co-clustering
Dhillon, I. S., Mallela, S., & Modha, D. S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956764 · Cited by 1,006
Combinatorial Stochastic Processes
(2006) · Lecture Notes in Mathematics · doi:10.1007/b11601500 · Cited by 935
Learning systems of concepts with an infinite relational model
Kemp, C., Tenenbaum, J. B., Griffiths, T. L., Yamada, T., & Ueda, N. (2006) · Cited by 550
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Getoor, L. C., & Taskar, B. (2007) · The MIT Press eBooks · Cited by 502
Improving Text Classification by Shrinkage in a Hierarchy of Classes
McCallum, A., Rosenfeld, R., Mitchell, T., & Ng, A. Y. (2022) · doi:10.1184/r1/21708647 · Cited by 471
Machine Invention of First-order Predicates by Inverting Resolution
MUGGLETON, S., & BUNTINE, W. (1988) · Machine Learning Proceedings 1988 · doi:10.1016/b978-0-934613-64-4.50040-2 · Cited by 436
Learning the structure of Markov logic networks
Kok, S., & Domingos, P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102407 · Cited by 298
Self-citationSpectral clustering for multi-type relational data
Long, B., Zhang, Z. (., Wú, X., & Yu, P. S. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143918 · Cited by 251
Sound and efficient inference with probabilistic and deterministic dependencies
Poon, H., & Domingos, P. (2006) · Cited by 234
Self-citationAn upper‐level ontology for the biomedical domain
McCray, A. T. (2003) · Comparative and Functional Genomics · doi:10.1002/cfg.255 · Cited by 212
Relational Learning with Statistical Predicate Invention: Better Models for Hypertext
Craven, M. W., & Slattery, S. (2001) · Machine Learning · doi:10.1023/a:1007676901476 · Cited by 125
Infinite hidden relational models
Xu, Z., Tresp, V., Yu, K., & Kriegel, H. (2006) · Cited by 125
Leveraging relational autocorrelation with latent group models
Neville, J., & Jensen, D. (2005) · Proceedings of the 4th international workshop on Multi-relational mining - MRDM '05 · doi:10.1145/1090193.1090201 · Cited by 121 · cited 4×
“Most of them only cluster objects, not relations (Popescul & Ungar, 2004; Wolfe & Jensen, 2004; Neville & Jensen, 2005; Xu et al., 2005; Long et al., 2006; Roy et al., 2006).”
BackgroundMethodInfluentialLearning Hidden Variable Networks: The Information Bottleneck Approach
Elidan, G., & Friedman, N. (2005) · doi:10.5555/1046920.1046924 · Cited by 82
Learning annotated hierarchies from relational data
Roy, D. M., Kemp, C., Mansinghka, V. K., & Tenenbaum, J. B. (2007) · The MIT Press eBooks · doi:10.7551/mitpress/7503.003.0153 · Cited by 76
Relational clichés: Constraining constructive induction during relational learning
Silverstein, G., & Pazzani, M. J. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50044-1 · Cited by 71
Cluster-based concept invention for statistical relational learning
Popescul, A., & Ungar, L. (2004) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1014052.1014137 · Cited by 38
Davis, J., Ong, I. M., Struyf, J., Burnside, E. S., Page, D., & Costa, V. S. (1862) · PubMed · Cited by 35
Improving efficiency by learning intermediate concepts
Wogulis, J., & Langley, P. (1989) · International Joint Conference on Artificial Intelligence · Cited by 33
Dimensionality of Nations Project: Attributes of Nations and Behavior of Nation Dyads, 1950-1965
Rummel, R. J. (1984) · ICPSR Data Holdings · doi:10.3886/icpsr05409.v1 · Cited by 7
Cited by
A Review of Relational Machine Learning for Knowledge Graphs
Nickel, M., Murphy, K., Tresp, V., & Gabrilovich, E. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2483592 · Cited by 1,638
Bordes, A., Glorot, X., Weston, J., & Bengio, Y. (2014) · Machine Learning · doi:10.1007/s10994-013-5363-6 · Cited by 675
Holographic embeddings of knowledge graphs
Nickel, M., Rosasco, L., & Poggio, T. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10314 · Cited by 559
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
Multi-Hop Knowledge Graph Reasoning with Reward Shaping
Lin, X. V., Socher, R., & Xiong, C. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1362 · Cited by 399
Metadata
- Authors
- Kok, S., & Domingos, P.
- Venue
- Proceedings of the 24th international conference on Machine learning
- Publisher
- ACM
- Published
- 2007-06-20
- Pages
- 433-440
- OpenAlex
- W2125027602
- Cited by
- 259
- References
- 23
- FWCI
- 7.37
- 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.