The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
A Unified Probabilistic Framework for Name Disambiguation in Digital Library
Abstract
Despite years of research, the name ambiguity problem remains largely unresolved. Outstanding issues include how to capture all information for name disambiguation in a unified approach, and how to determine the number of people K in the disambiguation process. In this paper, we formalize the problem in a unified probabilistic framework, which incorporates both attributes and relationships. Specifically, we define a disambiguation objective function for the problem and propose a two-step parameter estimation algorithm. We also investigate a dynamic approach for estimating the number of people K. Experiments show that our proposed framework significantly outperforms four baseline methods of using clustering algorithms and two other previous methods. Experiments also indicate that the number K automatically found by our method is close to the actual number.
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 new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
(1967) · Cited by 23,719
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Kass, R. E., & Raftery, A. E. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476572 · Cited by 12,558
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 2×
“[19], the step l can be simply set as 1 in most cases.”
BackgroundWiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
ANew Look at the Statistical Model Identification
AKAlKE, H. (2011) · Cited by 4,177
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
Clustering of the self-organizing map
Vesanto, J., & Alhoniemi, E. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846731 · Cited by 2,680
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
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
Self-citationA Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
Loopy Belief Propagation for Approximate Inference: An Empirical Study
Murphy, K. P., Weiss, Y., & Jordan, M. I. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6725 · Cited by 1,397
Markov Random Fields and Their Applications
Kindermann, R., & Snell, J. L. (1980) · Contemporary Mathematics · doi:10.1090/conm/001 · Cited by 1,290
A Reference Bayesian Test for Nested Hypotheses and its Relationship to the Schwarz Criterion
Kass, R. E., & Wasserman, L. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476592 · Cited by 1,253
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Graph clustering based on structural/attribute similarities
Zhou, Y., Cheng, H., & Yu, J. X. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687709 · Cited by 863
SCAN: a structural clustering algorithm for networks
Xu, X., Yuruk, N., Feng, Z., & Schweiger, T. A. J. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281280 · Cited by 842
A probabilistic framework for semi-supervised clustering
Basu, S., Bilenko, M., & Mooney, R. J. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014062 · Cited by 814
Retrieval evaluation with incomplete information
Buckley, C., & Voorhees, E. M. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009000 · Cited by 736
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
Markov fields on finite graphs and lattices
Hammersley, J. M., & Clifford, P. (1971) · Cited by 579
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_5 · Cited by 551
Ranking-based clustering of heterogeneous information networks with star network schema
Sun, Y., Yu, Y., & Han, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557107 · Cited by 513
Swoosh: a generic approach to entity resolution
Benjelloun, O., García-Molina, H., Menestrina, D., Su, Q., Whang, S. E., & Widom, J. (2008) · The VLDB Journal · doi:10.1007/s00778-008-0098-x · Cited by 489
Efficient aggregation for graph summarization
Tian, Y., Hankins, R. A., & Patel, J. M. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376675 · Cited by 442
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
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
Factorial Hidden Markov Models.
Ghahramani, Z., & Jordan, M. I. (1996) · doi:10.21236/ada307097 · Cited by 254
Semi-Supervised Clustering with User Feedback
Cohn, D., Kachites McCallum, A., & Hertz, T. (2008) · Chapman & Hall/CRC Data Mining and Knowledge Discovery Series · doi:10.1201/9781584889977.ch2 · Cited by 241
Entity resolution with iterative blocking
Whang, S. E., Menestrina, D., Koutrika, G., et al. (2009) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1559845.1559870 · Cited by 217
A Combination Approach to Web User Profiling
Tang, J., Yao, L., Zhang, D., & Zhang, J. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1870096.1870098 · Cited by 161
Self-citationEfficient 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
Object Distinction: Distinguishing Objects with Identical Names
Yin, X., Han, J., & Yu, P. S. (2007) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2007.368983 · Cited by 107
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
Exploiting context analysis for combining multiple entity resolution systems
Chen, Z., Kalashnikov, D. V., & Mehrotra, S. (2009) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/1559845.1559869 · Cited by 81
Künsch, H. R., Geman, S., & Kehagias, A. (1995) · The Annals of Applied Probability · doi:10.1214/aoap/1177004696 · Cited by 71
Bayesian k-Means as a “Maximization-Expectation” Algorithm
Kurihara, K., & Welling, M. (2009) · Neural Computation · doi:10.1162/neco.2008.12-06-421 · Cited by 67
Bayesian K-Means as a “Maximization-Expectation” Algorithm
Welling, M., & Kurihara, K. (2006) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.43 · Cited by 66
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
Spectral Regression for Dimensionality Reduction
Cai, D., He, X., & Han, J. (2007) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 57
Joint Cluster Analysis of Attribute Data and Relationship Data: the Connected k -Center Problem
Ester, M., Ge, R., Gao, B. J., Hu, Z., & Moshe, B. B. (2006) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972764.22 · Cited by 55
Generic entity resolution with negative rules
Whang, S. E., Benjelloun, O., & García-Molina, H. (2009) · The VLDB Journal · doi:10.1007/s00778-009-0136-3 · Cited by 54
Identification and tracing of ambiguous names: discriminative and generative approaches
Li, X., Morie, P., & Roth, D. (2004) · Cited by 52
A New Learning Algorithm for Mean Field Boltzmann Machines
Welling, M., & Hinton, G. E. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46084-5_57 · Cited by 47
Robust Reading: Identification and Tracing of Ambiguous Names
Li, X., Morie, P., & Roth, D. (2004) · doi:10.21236/ada457894 · Cited by 42
Cited by
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
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
COSNET: Connecting Heterogeneous Social Networks with Local and Global Consistency
Zhang, Y., Tang, J., Yang, Z., Pei, J., & Yu, P. S. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783268 · Cited by 283
Self-citation
Metadata
- Authors
- Tang, J., Fong, A. C. M., Wang, B., & Zhang, J.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2012-06
- Volume
- 24
- Issue
- 6
- Pages
- 975-987
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W2145893390
- Cited by
- 262
- References
- 51
- FWCI
- 18.64
- 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.