The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
What's in a name?: an unsupervised approach to link users across communities
Abstract
In this paper, we consider the problem of linking users across multiple online communities. Specifically, we focus on the alias-disambiguation step of this user linking task, which is meant to differentiate users with the same usernames. We start quantitatively analyzing the importance of the alias-disambiguation step by conducting a survey on 153 volunteers and an experimental analysis on a large dataset of About.me (75,472 users). The analysis shows that the alias-disambiguation solution can address a major part of the user linking problem in terms of the coverage of true pairwise decisions (46.8%). To the best of our knowledge, this is the first study on human behaviors with regards to the usages of online usernames. We then cast the alias-disambiguation step as a pairwise classification problem and propose a novel unsupervised approach. The key idea of our approach is to automatically label training instances based on two observations: (a) rare usernames are likely owned by a single natural person, e.g. pennystar88 as a positive instance; (b) common usernames are likely owned by different natural persons, e.g. tank as a negative instance. We propose using the n-gram probabilities of usernames to estimate the rareness or commonness of usernames. Moreover, these two observations are verified by using the dataset of Yahoo! Answers. The empirical evaluations on 53 forums verify: (a) the effectiveness of the classifiers with the automatically generated training data and (b) that the rareness and commonness of usernames can help user linking. We also analyze the cases where the classifiers fail.
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
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
Cited by
Social recommendation: a review
Tang, J., Hu, X., & Liu, H. (2013) · Social Network Analysis and Mining · doi:10.1007/s13278-013-0141-9 · Cited by 505
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
User Identity Linkage across Online Social Networks: A Review
Shu, K., Wang, S., Tang, J., Zafarani, R., & Liu, H. (2017) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3068777.3068781 · Cited by 267
"On the internet, nobody knows you're a dog": a twitter case study of anonymity in social networks
Peddinti, S. T., Ross, K. W., & Cappos, J. (2014) · Proceedings of the second ACM conference on Online social networks · doi:10.1145/2660460.2660467 · Cited by 128
Metadata
- Authors
- Liu, J., Zhang, F., Song, X., Song, Y.-I., Lin, C.-Y., & Hon, H.-W.
- Venue
- Proceedings of the sixth ACM international conference on Web search and data mining
- Publisher
- ACM
- Published
- 2013-02-04
- Pages
- 495-504
- OpenAlex
- W2075633077
- Cited by
- 226
- References
- 1
- FWCI
- 33.01
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: What's in a name?: an unsupervised approach to link users across communities. https://app.cochat.ai/papers/10.1145/2433396.2433457
- The paper
- Liu, J., Zhang, F., Song, X., Song, Y.-I., Lin, C.-Y., & Hon, H.-W. (2013). What's in a name?: an unsupervised approach to link users across communities. Proceedings of the sixth ACM international conference on Web search and data mining. https://doi.org/10.1145/2433396.2433457
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.