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.
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
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
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
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
Two supervised learning approaches for name disambiguation in author citations
Han, H., Giles, L., Zha, H., Li, C., & Tsioutsiouliklis, K. (2004) · Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/996350.996419 · Cited by 362
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Efficient similarity joins for near-duplicate detection
Xiao, C., Wang, W., Lin, X., Yu, J. X., & Wang, G. (2011) · ACM Transactions on Database Systems · doi:10.1145/2000824.2000825 · Cited by 331
Mining knowledge from text using information extraction
Mooney, R. J., & Bunescu, R. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1089815.1089817 · Cited by 292
Self-citationName disambiguation in author citations using a K-way spectral clustering method
Han, H., Zha, H., & Giles, C. L. (2005) · Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/1065385.1065462 · Cited by 272
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.