The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Entity Resolution with Markov Logic
Abstract
Entity resolution is the problem of determining which records in a database refer to the same entities, and is a crucial and expensive step in the data mining process. Interest in it has grown rapidly, and many approaches have been proposed. However, they tend to address only isolated aspects of the problem, and are often ad hoc. This paper proposes a well-founded, integrated solution to the entity resolution problem based on Markov logic. Markov logic combines first-order logic and probabilistic graphical models by attaching weights to first-order formulas, and viewing them as templates for features of Markov networks. We show how a number of previous approaches can be formulated and seamlessly combined in Markov logic, and how the resulting learning and inference problems can be solved efficiently. Experiments on two citation databases show the utility of this approach, and evaluate the contribution of the different components.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
(2021) · A First Course in Statistical Programming with R · doi:10.1017/9781108993456.011 · Cited by 13,724
(1999) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b98874 · Cited by 9,482
Hapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Self-citationFellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
Collins, M. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118694 · Cited by 1,862
Logical Foundations of Artificial Intelligence
(1987) · Elsevier eBooks · doi:10.1016/c2009-0-27551-9 · Cited by 1,567
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
(2016) · Biostatistics in Public Health Using STATA · doi:10.1201/b19547-8 · Cited by 1,037
Inducing features of random fields
Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.588021 · Cited by 1,036
Adaptive duplicate detection using learnable string similarity measures
Bilenko, M., & Mooney, R. J. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956759 · Cited by 926
The State of Record Linkage and Current Research Problems
Winkler, W. E. (1999) · Cited by 810
The merge/purge problem for large databases
Hernández, M. A., & Stolfo, S. J. (1995) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/223784.223807 · Cited by 809
Newcombe, H. B., Kennedy, J. M., Axford, S. J., & James, A. P. (1959) · Science · doi:10.1126/science.130.3381.954 · Cited by 770
Interactive deduplication using active learning
Sarawagi, S., & Bhamidipaty, A. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775087 · Cited by 692
On the hardness of approximate reasoning
Roth, D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(94)00092-1 · Cited by 611
Reference reconciliation in complex information spaces
Dong, X., Halevy, A., & Madhavan, J. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066168 · Cited by 518
Local search strategies for satisfiability testing
Selman, B., Kautz, H., & Cohen, B. (1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026/25 · Cited by 516
A Comparison of String Metrics for Matching Names and Records
Fienberg, W. W. C. A. P. R. A. S. (2003) · Cited by 479
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
Learning to match and cluster large high-dimensional data sets for data integration
Cohen, W. W., & Richman, J. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775116 · Cited by 347
Learning object identification rules for information integration
Tejada, S., Knoblock, C. A., & Minton, S. (2001) · Information Systems · doi:10.1016/s0306-4379(01)00042-4 · Cited by 310
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-citationUpton, G. J. G., & Agresti, A. (1991) · Biometrics · doi:10.2307/2532524 · Cited by 296
Identity Uncertainty and Citation Matching
Pasula, H., Marthi, B., Milch, B., Russell, S., & Shpitser, I. (2002) · Cited by 276
Learning domain-independent string transformation weights for high accuracy object identification
Tejada, S., Knoblock, C. A., & Minton, S. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775047.775099 · Cited by 257
Discriminative training of Markov logic networks
Singla, P., & Domingos, P. (2005) · Cited by 245
Self-citationConditional Models of Identity Uncertainty with Application to Noun Coreference
McCallum, A., & Wellner, B. (2004) · Cited by 226
Iterative record linkage for cleaning and integration
Bhattacharya, I., & Getoor, L. (2004) · Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery · doi:10.1145/1008694.1008697 · Cited by 206
A general stochastic approach to solving problems with hard and soft constraints
Kautz, H., Selman, B., & Jiang, Y. (1997) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/035/15 · Cited by 125
Memory-efficient inference in relational domains
Singla, P., & Domingos, P. (2006) · Cited by 85
Self-citationJoint deduplication of multiple record types in relational data
Culotta, A., & McCallum, A. (2005) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1099554.1099615 · Cited by 84
Learning to match and cluster large high-dimensional data sets for data integration
Cohen, W. W., & Richman, J. (2002) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/775107.775116 · Cited by 83
Object Identification with Attribute-Mediated Dependences
Singla, P., & Domingos, P. (2005) · Lecture notes in computer science · doi:10.1007/11564126_31 · Cited by 63
Self-citation
Cited by
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
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
Sarawagi, S. (2008) · Foundations and Trends in Databases · doi:10.1561/1900000003 · Cited by 707
Bordes, A., Glorot, X., Weston, J., & Bengio, Y. (2014) · Machine Learning · doi:10.1007/s10994-013-5363-6 · Cited by 675
BLOG: Probabilistic Models with Unknown Objects
Milch, B., Marthi, B., Russell, S., Sontag, D., Ong, D. L., & Kolobov, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0015 · Cited by 390
Metadata
- Authors
- Singla, P., & Domingos, P.
- Venue
- Sixth International Conference on Data Mining (ICDM'06)
- Publisher
- IEEE
- Published
- 2006-12
- Pages
- 572-582
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2171472464
- Cited by
- 359
- References
- 35
- FWCI
- 25.24
- 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.