The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Two supervised learning approaches for name disambiguation in author citations
Abstract
Due to name abbreviations, identical names, name misspellings, and pseudonyms inpublications or bibliographies (citations), an author may have multiple names and multiple authors may share the same name. Such name ambiguity affects the performance of document retrieval, web search, database integration, and may cause improper attribution to authors. This paper investigates two supervised learning approaches to disambiguate authors in the citations. One approach uses the naive Bayes probability model, a generative model; the other uses Support Vector Machines(SVMs) and the vector space representation of citations, a discriminative model. Both approaches utilize three types of citation attributes: co-author names, the title of the paper, and the title of the journal or proceeding. We illustrate these two approaches on two types of data, one collected from the web, mainly publication lists from homepages, the other collected from the DBLPcitation databases.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
An Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
Bar‐Shalom, Y. (1988) · Medical Entomology and Zoology · Cited by 3,157
Bar-Shalom, Y., Fortmann, T. E., & Cable, P. G. (1990) · The Journal of the Acoustical Society of America · doi:10.1121/1.398863 · Cited by 3,070
Fellegi, I. P., & Sunter, A. B. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501049 · Cited by 2,475
Probabilistic Latent Semantic Analysis
Hofmann, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6705 · Cited by 2,047
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
CiteSeer: an automatic citation indexing system
Giles, C. L., Bollacker, K. D., & Lawrence, S. (1998) · Proceedings of the third ACM conference on Digital libraries - DL '98 · doi:10.1145/276675.276685 · Cited by 1,040
Distributional clustering of English words
Pereira, F., Tishby, N., & Lee, L. (1993) · Proceedings of the 31st annual meeting on Association for Computational Linguistics - · doi:10.3115/981574.981598 · Cited by 974
An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet
Banerjee, S., & Pedersen, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45715-1_11 · Cited by 858
Real-world Data is Dirty: Data Cleansing and The Merge/Purge Problem
Hernández, M. A., & Stolfo, S. J. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009761603038 · Cited by 812
Distributional clustering of words for text classification
Baker, L. D., & McCallum, A. K. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290970 · Cited by 676
Viewing morphology as an inference process
Krovetz, R. (1993) · Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93 · doi:10.1145/160688.160718 · Cited by 656
Relational Learning of Pattern-Match Rules for Information Extraction.
Califf, M. E., & Mooney, R. J. (1997) · Cited by 507
A divisive information theoretic feature clustering algorithm for text classification
Dhillon, I. S., Mallela, S., & Kumar, R. (2003) · doi:10.5555/944919.944973 · Cited by 500
Adaptive name matching in information integration
Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S. (2003) · IEEE Intelligent Systems · doi:10.1109/mis.2003.1234765 · Cited by 469
Learning Hidden Markov Model Structure for Information Extraction
Seymore, K., & Rosenfeld, R. (2018) · doi:10.1184/r1/6606872 · Cited by 381
Bipartite graph partitioning and data clustering
Zha, H., He, X., Ding, C., Simon, H., & Gu, M. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502591 · Cited by 291
Self-citationIdentity 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
D-Lib Magazine: Publishing as the Honest Broker
Friedlander, A., & Rey, C. (1998) · The Serials Librarian · doi:10.1300/j123v33n01_01 · Cited by 228
A statistical learning learning model of text classification for support vector machines
Joachims, T. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.383974 · Cited by 224
Duplicate record elimination in large data files
Bitton, D., & DeWitt, D. J. (1983) · ACM Transactions on Database Systems · doi:10.1145/319983.319987 · Cited by 179
Hierarchical hidden Markov models for information extraction
Skounakis, M., Craven, M. W., & Ray, S. (2003) · Cited by 142
Use of support vector machines in extended named entity recognition
Takeuchi, K., & Collier, N. (2002) · Conference on Computational Natural Language Learning · doi:10.3115/1118853.1118882 · Cited by 137
Similarity-based estimation of word cooccurrence probabilities
Dagan, I., Pereira, F. M. B., & Lee, L. (1994) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981732.981770 · Cited by 122
Generative model-based clustering of directional data
Banerjee, A., Dhillon, I. S., Ghosh, J., & Sra, S. (2003) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/956750.956757 · Cited by 105
Bibliographic attribute extraction from erroneous references based on a statistical model
Takasu, A. (2003) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.5555/827140.827147 · Cited by 74
Training a naive bayes classifier via the EM algorithm with a class distribution constraint
Tsuruoka, Y., & Tsujii, J. (2003) · Conference on Computational Natural Language Learning · doi:10.3115/1119176.1119193 · Cited by 31
Cited by
ArnetMiner: extraction and mining of academic social networks
Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1402008 · Cited by 2,231
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
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
Self-citationDisambiguating 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
Metadata
- Authors
- Han, H., Giles, L., Zha, H., Li, C., & Tsioutsiouliklis, K.
- Venue
- Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries
- Publisher
- ACM
- Published
- 2004-06-07
- Pages
- 296-305
- OpenAlex
- W2162337786
- Cited by
- 362
- References
- 31
- FWCI
- 21.97
- Type
- conference paper
- 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.