skip to main content
10.1145/2783258.2788601acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

On the Reliability of Profile Matching Across Large Online Social Networks

Published:10 August 2015Publication History

ABSTRACT

Matching the profiles of a user across multiple online social networks brings opportunities for new services and applications as well as new insights on user online behavior, yet it raises serious privacy concerns. Prior literature has showed that it is possible to accurately match profiles, but their evaluation focused only on sampled datasets. In this paper, we study the extent to which we can reliably match profiles in practice, across real-world social networks, by exploiting public attributes, i.e., information users publicly provide about themselves. Today's social networks have hundreds of millions of users, which brings completely new challenges as a reliable matching scheme must identify the correct matching profile out of the millions of possible profiles. We first define a set of properties for profile attributes--Availability, Consistency, non-Impersonability, and Discriminability (ACID)--that are both necessary and sufficient to determine the reliability of a matching scheme. Using these properties, we propose a method to evaluate the accuracy of matching schemes in real practical cases. Our results show that the accuracy in practice is significantly lower than the one reported in prior literature. When considering entire social networks, there is a non-negligible number of profiles that belong to different users but have similar attributes, which leads to many false matches. Our paper sheds light on the limits of matching profiles in the real world and illustrates the correct methodology to evaluate matching schemes in realistic scenarios.

Skip Supplemental Material Section

Supplemental Material

p1799.mp4

mp4

182 MB

References

  1. Phash. http://www.phash.org.Google ScholarGoogle Scholar
  2. Spokeo. http://www.spokeo.com/.Google ScholarGoogle Scholar
  3. Spokeo lawsuit. http://www.ftc.gov/sites/default/files/documents/ cases/2012/06/120612spokeocmpt.pdf.Google ScholarGoogle Scholar
  4. A. Acquisti, R. Gross, and F. Stutzman. Faces of facebook: Privacy in the age of augmented reality. In BlackHat, 2011.Google ScholarGoogle Scholar
  5. R. Akbani, S. Kwek, and N. Japkowicz. Applying support vector machines to imbalanced datasets. In ECML, 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Get better results with less effort with Mechanical Turk Masters -- The Mechanical Turk blog. http://bit.ly/112GmQI.Google ScholarGoogle Scholar
  7. M. Balduzzi, C. Platzer, T. Holz, E. Kirda, D. Balzarotti, and C. Kruegel. Abusing social networks for automated user profiling. In RAID, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Christen. Data Matching - Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection. Data-centric systems and applications. Springer, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. W. W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IIWeb, 2003.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Goga. Matching User Accounts Across Online Social Networks: Methods and Applications. PhD thesis, UPMC, 2014.Google ScholarGoogle Scholar
  11. O. Goga, H. Lei, S. Parthasarathi, G. Friedland, R. Sommer, and R. Teixeira. Exploiting innocuous activity for correlating users across sites. In WWW, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. O. Goga, P. Loiseau, R. Sommer, R. Teixeira, and K. P. Gummadi. On the reliability of profile matching across large online social networks, 2015. Technical report, available as arXiv:1506.02289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. H. He and E. A. Garcia. Learning from imbalanced data. IEEE TKDE, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T. Iofciu, P. Fankhauser, F. Abel, and K. Bischoff. Identifying users across social tagging systems. In ICWSM, 2011.Google ScholarGoogle Scholar
  15. N. Korula and S. Lattanzi. An efficient reconciliation algorithm for social networks. PVLDB, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Kreibich, C. Kanich, K. Levchenko, B. Enright, G. M. Voelker, V. Paxson, and S. Savage. Spamcraft: An inside look at spam campaign orchestration. In LEET, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. S. Labitzke, I. Taranu, and H. Hartenstein. What your friends tell others about you: Low cost linkability of social network profiles. In SNA-KDD, 2011.Google ScholarGoogle Scholar
  18. J. Liu, F. Zhang, X. Song, Y.-I. Song, C.-Y. Lin, and H.-W. Hon. What's in a name?: An unsupervised approach to link users across communities. In WSDM, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. Liu, S. Wang, F. Zhu, J. Zhang, and R. Krishnan. Hydra: Large-scale social identity linkage via heterogeneous behavior modeling. In SIGMOD, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. D. G. Lowe. Distinctive image features from scale-invariant keypoints. IJCV, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. C.-T. Lu, H.-H. Shuai, and P. S. Yu. Identifying your customers in social networks. In CIKM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. A. Malhotra, L. Totti, W. Meira, P. Kumaraguru, and V. Almeida. Studying user footprints in different online social networks. In CSOSN, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. A. Mishari and G. Tsudik. Exploring linkability of user reviews. In ESORICS, 2012.Google ScholarGoogle Scholar
  24. M. Motoyama and G. Varghese. I seek you: searching and matching individuals in social networks. In WIDM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. A. Narayanan and V. Shmatikov. De-anonymizing social networks. In IEEE S&P, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. C. T. Northern and M. L. Nelson. An unsupervised approach to discovering and disambiguating social media profiles. In MDSW, 2011.Google ScholarGoogle Scholar
  27. P. K. Paridhi Jain and A. Joshi. @i seek 'fb.me': Identifying users across multiple online social networks. In WoLE, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Peekyou. http://www.peekyou.com/.Google ScholarGoogle Scholar
  29. O. Peled, M. Fire, L. Rokach, and Y. Elovici. Entity matching in online social networks. In SocialCom, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. D. Perito, C. Castelluccia, M. Ali Kâafar, and P. Manils. How unique and traceable are usernames? In PETS, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. E. Raad, R. Chbeir, and A. Dipanda. User profile matching in social networks. In NBiS, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. R. Schmid. Salesforce service cloud -- featuring activision, 2012. http://www.youtube.com/watch?v=eT6iHEdnKQ4&feature=relmfu.Google ScholarGoogle Scholar
  33. Y. Shen and H. Jin. Controllable information sharing for user accounts linkage across multiple online social networks. In CIKM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Social Intelligence Corp. http://www.socialintel.com/.Google ScholarGoogle Scholar
  35. L. Sweeney. Weaving technology and policy together to maintain confidentiality. Journal of Law, Medicine, and Ethics, 1997.Google ScholarGoogle Scholar
  36. J. Vosecky, D. Hong, and V. Shen. User identification across multiple social networks. In NDT, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  37. G.-w. You, S.-w. Hwang, Z. Nie, and J.-R. Wen. Socialsearch: enhancing entity search with social network matching. In EDBT/ICDT, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. R. Zafarani and H. Liu. Connecting corresponding identities across communities. In ICWSM, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  39. R. Zafarani and H. Liu. Connecting users across social media sites: A behavioral-modeling approach. In KDD, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the Reliability of Profile Matching Across Large Online Social Networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          KDD '15: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
          August 2015
          2378 pages
          ISBN:9781450336642
          DOI:10.1145/2783258

          Copyright © 2015 ACM

          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]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 10 August 2015

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          KDD '15 Paper Acceptance Rate160of819submissions,20%Overall Acceptance Rate1,133of8,635submissions,13%

          Upcoming Conference

          KDD '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader