The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Adaptive name matching in information integration
Abstract
Identifying approximately duplicate database records that refer to the same entity is essential for information integration. The authors compare and describe methods for combining and learning textual similarity measures for name matching.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Biological sequence analysis probabilistic models of proteins and nucleic acids
Durbin, R. M., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cited by 3,565
Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids
Durbin, R., Eddy, S. R., Krogh, A., & Mitchison, G. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511790492 · Cited by 3,246
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
Advances in Record-Linkage Methodology as Applied to Matching the 1985 Census of Tampa, Florida
Jaro, M. A. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478785 · Cited by 1,401
Learning to Classify Text Using Support Vector Machines
Joachims, T. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0907-3 · Cited by 1,366
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
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Joachims, T. (2002) · Cited by 932
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
Self-citationRistad, E. S., & Yianilos, P. N. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.682181 · Cited by 859
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
Probabilistic linkage of large public health data files
Jaro, M. A. (1995) · Statistics in Medicine · doi:10.1002/sim.4780140510 · Cited by 782
Newcombe, H. B., Kennedy, J. M., Axford, S. J., & James, A. P. (1959) · Science · doi:10.1126/science.130.3381.954 · Cited by 770
The field matching problem: Algorithms and applications
Monge, A. E., & Elkan, C. (1996) · Cited by 471
Learning Hidden Markov Model Structure for Information Extraction
Seymore, K., & Rosenfeld, R. (2018) · doi:10.1184/r1/6606872 · Cited by 381
Cohen, W. W. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276323 · Cited by 379
Self-citationDeclarative Data Cleaning: Language, Model, and Algorithms
Galhardas, H., Florescu, D., Shasha, D. E., Simon, E., & Saita, C.-A. (2001) · Cited by 320
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
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
Data integration using similarity joins and a word-based information representation language
Cohen, W. W. (2000) · ACM Transactions on Information Systems · doi:10.1145/352595.352598 · Cited by 223
Self-citationAJAX: an extensible data cleaning tool
Galhardas, H., Florescu, D., Shasha, D., & Simon, E. (2000) · ACM SIGMOD Record · doi:10.1145/335191.336568 · Cited by 174
Preparation of name and address data for record linkage using hidden Markov models
Churches, T., Christen, P., Lim, K., & Zhu, J. X. (2002) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-2-9 · Cited by 109
Using the EM Algorithm for Weight Computation in the Fellegi-Sunter Model of Record Linkage
Winkler, W. E., & Winkler, W. E. (2000) · Cited by 94
Cited by
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
Entity Linking with a Knowledge Base: Issues, Techniques, and Solutions
Shen, W., Wang, J., & Han, J. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2327028 · Cited by 761
Sarawagi, S. (2008) · Foundations and Trends in Databases · doi:10.1561/1900000003 · Cited by 707
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
(2006) · doi:10.5555/1182635.1164130 · Cited by 553
Metadata
- Authors
- Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S.
- Venue
- IEEE Intelligent Systems
- Published
- 2003-09
- Volume
- 18
- Issue
- 5
- Pages
- 16-23
- ISSN
- 1541-1672 (ISSN-L)
- OpenAlex
- W2135223301
- Cited by
- 469
- References
- 25
- FWCI
- 26.54
- 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.