The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
A brief survey of automatic methods for author name disambiguation
Open accessAbstract
Name ambiguity in the context of bibliographic citation records is a hard problem that affects the quality of services and content in digital libraries and similar systems. The challenges of dealing with author name ambiguity have led to a myriad of disambiguation methods. Generally speaking, the proposed methods usually attempt to group citation records of a same author by finding some similarity among them or try to directly assign them to their respective authors. Both approaches may either exploit supervised or unsupervised techniques. In this article, we propose a taxonomy for characterizing the current author name disambiguation methods described in the literature, present a brief survey of the most representative ones and discuss several open challenges.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
(1996) · Cited by 20,179
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
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
Large margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Spectral Relaxation for K-means Clustering
Hongyuan Zha, B., He, X., Ding, C. H. Q., Gu, M., & Simon, H. D. (2001) · neural information processing systems · Cited by 687
Large Margin Classification Using the Perceptron Algorithm
Freund, Y., & Schapire, R. E. (1999) · Machine Learning · doi:10.1023/a:1007662407062 · Cited by 604
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
The open archives initiative: building a low-barrier interoperability framework
Lagoze, C., & de Sompel, H. V. (2001) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/379437.379449 · Cited by 510
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
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/jmlr.2003.3.4-5.951 · Cited by 307
Non-metric affinity propagation for unsupervised image categorization
Dueck, D., & Frey, B. J. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408853 · Cited by 297
Author name disambiguation in MEDLINE
Torvik, V. I., & Smalheiser, N. R. (2009) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1552303.1552304 · Cited by 285
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
Disambiguating Web appearances of people in a social network
Bekkerman, R., & McCallum, A. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060813 · Cited by 271
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
A Unified Probabilistic Framework for Name Disambiguation in Digital Library
Tang, J., Fong, A. C. M., Wang, B., & Zhang, J. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.13 · Cited by 262
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
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
On co-authorship for author disambiguation
Kang, I.-S., Na, S., Lee, S., Jung, H., Kim, P., Sung, W.-K., & Lee, J.-H. (2008) · Information Processing & Management · doi:10.1016/j.ipm.2008.06.006 · Cited by 157
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
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
Effective self-training author name disambiguation in scholarly digital libraries
Ferreira, A. A., Veloso, A., Gonçalves, M. A., & Laender, A. H. F. (2010) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/1816123.1816130 · Cited by 75
Self-citationPerson name disambiguation by bootstrapping
Yoshida, M., Ikeda, M., Ono, S., Sato, I., & Nakagawa, H. (2010) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1835449.1835454 · Cited by 72
Lee, D., Kang, J., Mitra, P., Giles, C. L., & On, B.-W. (2007) · Communications of the ACM · doi:10.1145/1323688.1323690 · Cited by 68
A Latent Topic Model for Complete Entity Resolution
Shu, L., Long, B., & Meng, W. (2009) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2009.29 · Cited by 59
Separating the articles of authors with the same name
Soler, J. M. (2007) · Scientometrics · doi:10.1007/s11192-007-1730-z · Cited by 58
Cost-effective on-demand associative author name disambiguation
Veloso, A., Ferreira, A. A., Gonçalves, M. A., Laender, A. H. F., & Meira, W. (2011) · Information Processing & Management · doi:10.1016/j.ipm.2011.08.005 · Cited by 52
Self-citationName Reference Resolution in Organizational Email Archives
Diehl, C., Getoor, L., & Namata, G. M. S. (2006) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.7 · Cited by 31
Big Macs and Eigenfactor scores: Don't let correlation coefficients fool you
Eschenfelder, K. R. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.v61:9 · Cited by 27
Cited by
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
The science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
The 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
“In order to control for this, we had to identify individual authors, a challenging task in itself [53–57].”
BackgroundCollaborating 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
Xia, F., Wang, W., Bekele, T. M., & Liu, H. (2017) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2641460 · Cited by 266
Metadata
- Authors
- Ferreira, A. A., Gonçalves, M. A., & Laender, A. H. F.
- Venue
- ACM SIGMOD Record
- Published
- 2012-08-17
- Volume
- 41
- Issue
- 2
- Pages
- 15-26
- ISSN
- 0163-5808 (ISSN-L)
- OpenAlex
- W2129558264
- Cited by
- 293
- References
- 33
- FWCI
- 26.26
- 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.