The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Entity resolution: theory, practice & open challenges
Abstract
This tutorial brings together perspectives on ER from a variety of fields, including databases, machine learning, natural language processing and information retrieval, to provide, in one setting, a survey of a large body of work. We discuss both the practical aspects and theoretical underpinnings of ER. We describe existing solutions, current challenges, and open research problems.
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
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
A comparison of string distance metrics for name-matching tasks
Cohen, W. W., Ravikumar, P., & Fienberg, S. E. (2003) · International Joint Conference on Artificial Intelligence · Cited by 1,369
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
Ristad, E. S., & Yianilos, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682181 · Cited by 859
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
Christen, P. (2012) · Springer eBooks · doi:10.1007/978-3-642-31164-2 · Cited by 732
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
Collective entity resolution in relational data
Bhattacharya, I., & Getoor, L. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217304 · Cited by 593
Self-citationReference 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
Swoosh: a generic approach to entity resolution
Benjelloun, O., García-Molina, H., Menestrina, D., Su, Q., Whang, S. E., & Widom, J. (2008) · The VLDB Journal · doi:10.1007/s00778-008-0098-x · Cited by 489
Cited by
A Survey of Fake News: Fundamental Theories, Detection Methods, and Opportunities
Zhou, X., & Zafarani, R. (2021) · ACM Computing Surveys · doi:10.1145/3395046 · Cited by 1,184
HoloClean: holistic data repairs with probabilistic inference
Rekatsinas, T., Chu, X., Ilyas, I. F., & Ré, C. (2017) · Proceedings of the VLDB Endowment · doi:10.14778/3137628.3137631 · Cited by 480
User Identity Linkage across Online Social Networks: A Review
Shu, K., Wang, S., Tang, J., Zafarani, R., & Liu, H. (2017) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3068777.3068781 · Cited by 267
A note on using the F-measure for evaluating record linkage algorithms
Hand, D., & Christen, P. (2018) · Statistics and Computing · doi:10.1007/s11222-017-9746-6 · Cited by 247
Machine Learning for Refining Knowledge Graphs: A Survey
Subagdja, B., Shanthoshigaa, D., Wang, Z., & Tan, A.-H. (2024) · ACM Computing Surveys · doi:10.1145/3640313 · Cited by 24
Metadata
- Authors
- Getoor, L., & Machanavajjhala, A.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-08
- Volume
- 5
- Issue
- 12
- Pages
- 2018-2019
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2041439319
- Cited by
- 348
- References
- 24
- FWCI
- 18.70
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entity resolution: theory, practice & open challenges. https://app.cochat.ai/papers/10.14778/2367502.2367564
- The paper
- Getoor, L., & Machanavajjhala, A. (2012). Entity resolution: theory, practice & open challenges. Proceedings of the VLDB Endowment. https://doi.org/10.14778/2367502.2367564
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.