The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Disambiguating Web appearances of people in a social network
Open accessAbstract
Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, and which are about other people who happen to have the same name? Furthermore, if we are looking for multiple people who are related in some way, how can we best leverage this social network? This paper presents two unsupervised frameworks for solving this problem: one based on link structure of the Web pages, another using Agglomerative/Conglomerative Double Clustering (A/CDC)---an application of a recently introduced multi-way distributional clustering method. To evaluate our methods, we collected and hand-labeled a dataset of over 1000 Web pages retrieved from Google queries on 12 personal names appearing together in someones in an email folder. On this dataset our methods outperform traditional agglomerative clustering by more than 20%, achieving over 80% F-measure.
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
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
Self-citationThe information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 1×
“The Information Bottleneck (IB) method [21] is a convenient information-theoretic framework for solving various real-world problems, especially clustering.”
MethodLearning to Classify Text Using Support Vector Machines
Joachims, T. (2002) · Springer eBooks · doi:10.1007/978-1-4615-0907-3 · Cited by 1,366
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Joachims, T. (2002) · Cited by 932
Improving machine learning approaches to coreference resolution
Ng, V., & Cardie, C. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073102 · Cited by 702
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
(1999) · Cited by 397
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
Unsupervised document classification using sequential information maximization
Slonim, N., Friedman, N., & Tishby, N. (2002) · Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/564376.564401 · Cited by 249
Conditional Models of Identity Uncertainty with Application to Noun Coreference
McCallum, A., & Wellner, B. (2004) · Cited by 226
Self-citation
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
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
Metadata
- Authors
- Bekkerman, R., & McCallum, A.
- Venue
- Proceedings of the 14th international conference on World Wide Web - WWW '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 463
- OpenAlex
- W1982678692
- Cited by
- 271
- References
- 14
- Type
- conference abstract
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Disambiguating Web appearances of people in a social network. https://app.cochat.ai/papers/10.1145/1060745.1060813
- The paper
- Bekkerman, R., & McCallum, A. (2005). Disambiguating Web appearances of people in a social network. Proceedings of the 14th international conference on World Wide Web - WWW '05. https://doi.org/10.1145/1060745.1060813
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.