The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Author name disambiguation in MEDLINE
Open accessAbstract
Background : We recently described “Author-ity,” a model for estimating the probability that two articles in MEDLINE, sharing the same author name, were written by the same individual. Features include shared title words, journal name, coauthors, medical subject headings, language, affiliations, and author name features (middle initial, suffix, and prevalence in MEDLINE). Here we test the hypothesis that the Author-ity model will suffice to disambiguate author names for the vast majority of articles in MEDLINE. Methods : Enhancements include: (a) incorporating first names and their variants, email addresses, and correlations between specific last names and affiliation words; (b) new methods of generating large unbiased training sets; (c) new methods for estimating the prior probability; (d) a weighted least squares algorithm for correcting transitivity violations; and (e) a maximum likelihood based agglomerative algorithm for computing clusters of articles that represent inferred author-individuals. Results : Pairwise comparisons were computed for all author names on all 15.3 million articles in MEDLINE (2006 baseline), that share last name and first initial, to create Author-ity 2006, a database that has each name on each article assigned to one of 6.7 million inferred author-individual clusters. Recall is estimated at ∼98.8%. Lumping (putting two different individuals into the same cluster) affects ∼0.5% of clusters, whereas splitting (assigning articles written by the same individual to >1 cluster) affects ∼2% of articles. Impact : The Author-ity model can be applied generally to other bibliographic databases. Author name disambiguation allows information retrieval and data integration to become person-centered , not just document-centered , setting the stage for new data mining and social network tools that will facilitate the analysis of scholarly publishing and collaboration behavior. Availability: The Author-ity 2006 database is available for nonprofit academic research, and can be freely queried via http://arrowsmith.psych.uic.edu.
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
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Probabilistic linkage of large public health data files
Jaro, M. A. (1995) · Statistics in Medicine · doi:10.1002/sim.4780140510 · Cited by 782
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
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
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
Name 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
A Latent Dirichlet Model for Unsupervised Entity Resolution
Bhattacharya, I., & Getoor, L. (2006) · Proceedings of the 2006 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.5 · Cited by 266
Smalheiser, N. R., & Torvik, V. I. (2009) · Annual Review of Information Science and Technology · doi:10.1002/aris.2009.1440430113 · Cited by 249
Self-citationAdaptive Blocking: Learning to Scale Up Record Linkage
Bilenko, M., Kamath, B., & Mooney, R. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.13 · Cited by 235
Winkler, W. E. (1995) · Wiley series in probability and statistics · doi:10.1002/9781118150504.ch20 · Cited by 222
A probabilistic similarity metric for Medline records: A model for author name disambiguation
Torvik, V. I., Weeber, M., Swanson, D. R., & Smalheiser, N. R. (2005) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20105 · Cited by 192
Self-citationA Day in the Life of PubMed: Analysis of a Typical Day's Query Log
Herskovic, J. R., Tanaka, L. Y., Hersh, W., & Bernstam, E. V. (2007) · Journal of the American Medical Informatics Association · doi:10.1197/jamia.m2191 · Cited by 170
Efficient Name Disambiguation for Large-Scale Databases
Huang, J. L., Ertekin, Ş., & Giles, C. L. (2006) · Lecture notes in computer science · doi:10.1007/11871637_53 · Cited by 165
Domain-independent data cleaning via analysis of entity-relationship graph
Kalashnikov, D. V., & Mehrotra, S. (2006) · ACM Transactions on Database Systems · doi:10.1145/1138394.1138401 · Cited by 165
Efficient topic-based unsupervised name disambiguation
Song, Y., Huang, J. L., Councill, I. G., Li, J., & Giles, C. L. (2007) · ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL) · doi:10.1145/1255175.1255243 · Cited by 154
Wilbur, W. J., & Yang, Y. (1996) · Computers in Biology and Medicine · doi:10.1016/0010-4825(95)00055-0 · Cited by 118
Search engine driven author disambiguation
Tan, Y. F., Kan, M., & Lee, D. (2006) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/1141753.1141826 · Cited by 83
Author Disambiguation using Error-driven Machine Learning with a Ranking Loss Function
Culotta, A., Kanani, P. H., Hall, R., Wick, M., & McCallum, A. (2007) · Scholarworks (University of Massachusetts Amherst) · Cited by 80
A quantitative model for linking two disparate sets of articles in MEDLINE
Torvik, V. I., & Smalheiser, N. R. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm161 · Cited by 75
Self-citationSmalheiser, N. R., Torvik, V. I., & Zhou, W. (2009) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2008.12.006 · Cited by 70
Self-citationHolmes, D. I., Robertson, M., & Paez, R. (2001) · Computers and the Humanities · doi:10.1023/a:1017549100097 · Cited by 70
Smalheiser, N. R., Zhou, W., & Torvik, V. I. (2008) · Journal of Biomedical Discovery and Collaboration · doi:10.1186/1747-5333-3-2 · Cited by 66
Self-citationScientific publishing: Identity crisis
Qiu, J. X. J. (2008) · Nature · doi:10.1038/451766a · Cited by 62
Separating the articles of authors with the same name
Soler, J. M. (2007) · Scientometrics · doi:10.1007/s11192-007-1730-z · Cited by 58
Using clustering strategies for creating authority files
French, J. C., Powell, A. L., & Schulman, E. (2000) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(2000)51:8<774::aid-asi90>3.0.co;2-p · Cited by 44
British Quest for Uniqueness versus American Egocentrism
Garfield, E. (1969) · Nature · doi:10.1038/223763b0 · Cited by 22
Cited by
PubMed and beyond: a survey of web tools for searching biomedical literature
Lu, Z. (2011) · Database · doi:10.1093/database/baq036 · Cited by 571
Disambiguation and co-authorship networks of the U.S. patent inventor database (1975–2010)
Li, G.-C., Lai, R., D’Amour, A., Doolin, D. M., Sun, Y., Torvik, V. I., Yu, A. Z., & Fleming, L. (2014) · Research Policy · doi:10.1016/j.respol.2014.01.012 · Cited by 498
Self-citationThe citation advantage of linking publications to research data
Colavizza, G., Hrynaszkiewicz, I., Staden, I., Whitaker, K., & McGillivray, B. (2020) · PLOS ONE · doi:10.1371/journal.pone.0230416 · Cited by 335
Collaborating with People Like Me: Ethnic Coauthorship within the United States
Freeman, R. B., & Huang, W. (2015) · Journal of Labor Economics · doi:10.1086/678973 · Cited by 326
A brief survey of automatic methods for author name disambiguation
Ferreira, A. A., Gonçalves, M. A., & Laender, A. H. F. (2012) · ACM SIGMOD Record · doi:10.1145/2350036.2350040 · Cited by 293
Metadata
- Authors
- Torvik, V. I., & Smalheiser, N. R.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2009-07
- Volume
- 3
- Issue
- 3
- Pages
- 1-29
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W1964879903
- Cited by
- 285
- References
- 26
- FWCI
- 18.31
- Type
- journal article
- Language
- en
- Open access
- green
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.