skip to main content
10.1145/2433396.2433457acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

What's in a name?: an unsupervised approach to link users across communities

Published: 04 February 2013 Publication History

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.

References

[1]
F. Abel, N. Henze, E. Herder, and D. Krause. Interweaving public user profiles on the web. In Proceedings of UMAP, 2010.
[2]
E. Acuna and C. Rodriguez. The treatment of missing values and its effect on classifier accuracy. Classification, Clustering, and Data Mining Applications, 2004.
[3]
L. Backstrom, C. Dwork, and J. Kleinberg. Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In Proceedings of WWW, 2007.
[4]
E. Bengtson and D. Roth. Understanding the value of features for coreference resolution. In Proceedings of EMNLP, 2008.
[5]
I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(1), 2007.
[6]
J. Cai and M. Strube. End-to-end coreference resolution via hypergraph partitioning. In Proceedings of COLING, 2010.
[7]
C. Chang and C. Lin. Libsvm: a library for support vector machines. ACM Transactions on Intelligent Systems and Technology (TIST), 2(3), 2011.
[8]
T. Cover, J. Thomas, J. Wiley, et al. Elements of information theory, volume 6. 1991.
[9]
A. Elmagarmid, P. Ipeirotis, and V. Verykios. Duplicate record detection: A survey. IEEE Transactions on Knowledge and Data Engineering (TKDE), 19(1), 2007.
[10]
D. Frankowski, D. Cosley, S. Sen, L. Terveen, and J. Riedl. You are what you say: privacy risks of public mentions. In Proceedings of SIGIR, 2006.
[11]
R. Gonzalez and R. Woods. Digital image processing. 2002.
[12]
T. Iofciu, P. Fankhauser, F. Abel, and K. Bischoff. Identifying users across social tagging systems. In Proceedings of ICWSM, 2011.
[13]
D. Kalashnikov, Z. Chen, S. Mehrotra, and R. Nuray-Turan. Web people search via connection analysis. IEEE Transactions on Knowledge and Data Engineering (TKDE), 20(11), 2008.
[14]
S. Kumar, R. Zafarani, and H. Liu. Understanding user migration patterns in social media. In Proceedings of AAAI, 2011.
[15]
S. Labitzke, I. Taranu, and H. Hartenstein. What your friends tell others about you: Low cost linkability of social network profiles. In Proceedings of SNAKDD, 2011.
[16]
J. Liu, X. Song, J. Jiang, and C. Lin. An unsupervised method for author extraction from web pages containing user-generated content. In Proceedings of CIKM, 2012.
[17]
J. Liu, Y. Song, and C. Lin. Competition-based user expertise score estimation. In Proceedings of SIGIR, 2011.
[18]
K. Liu and E. Terzi. A framework for computing the privacy scores of users in online social networks. In Proceedings of ICDM, 2009.
[19]
A. Malhotra, L. Totti, W. Meira, P. Kumaraguru, and V. Almeida. Studying user footprints in different online social networks. In Proceedings of CSOSN, 2012.
[20]
A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In Proceedings of S&P, 2008.
[21]
A. Narayanan and V. Shmatikov. De-anonymizing social networks. In Proceedings of S&P, 2009.
[22]
A. Narayanan and V. Shmatikov. Myths and fallacies of personally identifiable information. Communications of the ACM, 53(6), 2010.
[23]
M. Newman. Communities, modules and large-scale structure in networks. Nature Physics, 8(1), 2011.
[24]
J. Novak, P. Raghavan, and A. Tomkins. Anti-aliasing on the web. In Proceedings of WWW, 2004.
[25]
A. Nunes, P. Calado, and B. Martins. Resolving user identities over social networks through supervised learning and rich similarity features. In Proceedings of SAC, 2012.
[26]
Y. Qian, Y. Hu, J. Cui, Q. Zheng, and Z. Nie. Combining machine learning and human judgment in author disambiguation. In Proceedings of CIKM, 2011.
[27]
J. Rao and P. Rohatgi. Can pseudonymity really guarantee privacy. In Proceedings of USENIX, 2000.
[28]
W. Soon, H. Ng, and D. Lim. A machine learning approach to coreference resolution of noun phrases. Computational Linguistics, 27(4), 2001.
[29]
J. Vosecky, D. Hong, and V. Shen. User identification across multiple social networks. In Proceedings of NDT, 2009.
[30]
K. Wang, C. Thrasher, and B. Hsu. Web scale nlp: A case study on url word breaking. In Proceedings of WWW, 2011.
[31]
K. Wang, C. Thrasher, E. Viegas, X. Li, and B. Hsu. An overview of microsoft web n-gram corpus and applications. In Proceedings of NAACL, 2010.
[32]
J. Weng, E.-P. Lim, J. Jiang, and Q. He. Twitterrank: finding topic-sensitive influential twitterers. In Proceedings of WSDM, 2010.
[33]
R. Zafarani and H. Liu. Connecting corresponding identities across communities. In Proceedings of ICWSM, 2009.

Cited By

View all

Index Terms

  1. What's in a name?: an unsupervised approach to link users across communities

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining
    February 2013
    816 pages
    ISBN:9781450318693
    DOI:10.1145/2433396
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 February 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. pairwise classification
    2. social network
    3. user linking

    Qualifiers

    • Research-article

    Conference

    WSDM 2013

    Acceptance Rates

    Overall Acceptance Rate 498 of 2,863 submissions, 17%

    Upcoming Conference

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)36
    • Downloads (Last 6 weeks)4
    Reflects downloads up to 25 Dec 2024

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media