The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Evaluation of entity resolution approaches on real-world match problems
Abstract
Despite the huge amount of recent research efforts on entity resolution (matching) there has not yet been a comparative evaluation on the relative effectiveness and efficiency of alternate approaches. We therefore present such an evaluation of existing implementations on challenging real-world match tasks. We consider approaches both with and without using machine learning to find suitable parameterization and combination of similarity functions. In addition to approaches from the research community we also consider a state-of-the-art commercial entity resolution implementation. Our results indicate significant quality and efficiency differences between different approaches. We also find that some challenging resolution tasks such as matching product entities from online shops are not sufficiently solved with conventional approaches based on the similarity of attribute values.
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
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
(2000) · Cited by 1,467
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
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 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
(2006) · Data-Centric Systems and Applications · doi:10.1007/3-540-33173-5 · Cited by 659
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
Efficient similarity joins for near duplicate detection
Xiao, C., Wang, W., Lin, X., & Yu, J. X. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367516 · Cited by 455
Eliminating Fuzzy Duplicates in Data Warehouses
Ananthakrishna, R., Chaudhuri, S., & Ganti, V. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50058-5 · Cited by 387
A Comparison of Fast Blocking Methods for Record Linkage
Baxter, R. A., Christen, P., & Churches, T. (2003) · ANU Open Research (Australian National University) · Cited by 337
A Comparison of Personal Name Matching: Techniques and Practical Issues
Christen, P. (2006) · Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) · doi:10.1109/icdmw.2006.2 · Cited by 331
Data Quality: Concepts, Methodologies and Techniques (Data-Centric Systems and Applications)
Batini, C., & Scannapieco, M. (2006) · Springer eBooks · Cited by 321
Record linkage: similarity measures and algorithms
Koudas, N., Sarawagi, S., & Srivastava, D. (2006) · Proceedings of the 2006 ACM SIGMOD international conference on Management of data · doi:10.1145/1142473.1142599 · Cited by 289
TAILOR: a record linkage toolbox
Elfeky, M. G., Verykios, V. S., & Elmagarmid, A. K. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994694 · Cited by 289
Framework for evaluating clustering algorithms in duplicate detection
Hassanzadeh, O., Chiang, F., Lee, H., & Miller, R. J. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687771 · Cited by 238
Learning blocking schemes for record linkage
Michelson, M., & Knoblock, C. A. (2006) · National Conference on Artificial Intelligence · Cited by 152
Febrl: a freely available record linkage system with a graphical user interface
Christen, P. (2008) · Cited by 94
Example-driven Design of Efficient Record Matching Queries
Chaudhuri, S., Chen, B.-C., Ganti, V., & Kaushik, R. (2008) · Cited by 87
Joint 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
Object Identification with Attribute-Mediated Dependences
Singla, P., & Domingos, P. (2005) · Lecture notes in computer science · doi:10.1007/11564126_31 · Cited by 69
Link-based Classification using Labeled and Unlabeled Data
Lu, Q. L., & Getoor, L. C. (2003) · Cited by 52
Training selection for tuning entity matching.
Köpcke, H., & Rahm, E. (2008) · Qucosa (Saxon State and University Library Dresden) · Cited by 50
Self-citation
Cited by
Deep Learning for Entity Matching: A Design Space Exploration
Mudgal, S., Li, H., Rekatsinas, T., Doan, A., Park, Y., Krishnan, G., Deep, R., Arcaute, E., & Raghavendra, V. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3196926 · Cited by 550
Dong, X. L., & Srivastava, D. (2015) · Synthesis Lectures on Data Management · doi:10.1007/978-3-031-01853-4 · Cited by 539
CrowdER: crowdsourcing entity resolution
Wang, J., Kraska, T., Franklin, M. J., & Feng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2350229.2350263 · Cited by 507
Entity resolution: theory, practice & open challenges
Getoor, L., & Machanavajjhala, A. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367564 · Cited by 348
Deep entity matching with pre-trained language models
Li, Y., Li, J., Suhara, Y., Doan, A., & Tan, W.-C. (2020) · Proceedings of the VLDB Endowment · doi:10.14778/3421424.3421431 · Cited by 339
Metadata
- Authors
- Köpcke, H., Thor, A., & Rahm, E.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2010-09
- Volume
- 3
- Issue
- 1-2
- Pages
- 484-493
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W1981590391
- Cited by
- 443
- References
- 23
- FWCI
- 27.03
- 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
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.