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

You are who you know: inferring user profiles in online social networks

Published:04 February 2010Publication History

ABSTRACT

Online social networks are now a popular way for users to connect, express themselves, and share content. Users in today's online social networks often post a profile, consisting of attributes like geographic location, interests, and schools attended. Such profile information is used on the sites as a basis for grouping users, for sharing content, and for suggesting users who may benefit from interaction. However, in practice, not all users provide these attributes.

In this paper, we ask the question: given attributes for some fraction of the users in an online social network, can we infer the attributes of the remaining users? In other words, can the attributes of users, in combination with the social network graph, be used to predict the attributes of another user in the network? To answer this question, we gather fine-grained data from two social networks and try to infer user profile attributes. We find that users with common attributes are more likely to be friends and often form dense communities, and we propose a method of inferring user attributes that is inspired by previous approaches to detecting communities in social networks. Our results show that certain user attributes can be inferred with high accuracy when given information on as little as 20% of the users.

References

  1. L. Adamic and E. Adar. Friends and neighbors on the web. Social Networks, 25(3):211--230, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  2. R. Andersen and K.J. Lang. Communities from seed sets. In Proc. WWW'06, Edinburgh, Scotland, May 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J.P. Bagrow. Evaluating local community methods in networks. J. Stat. Mech., 2008(5), 2008.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Clauset. Finding local community structure in networks. Physical Review E, 72, 2005.Google ScholarGoogle Scholar
  5. A. Clauset, M.E.J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70(6), 2004.Google ScholarGoogle ScholarCross RefCross Ref
  6. O. Simsek and D. Jensen. Navigating networks by using homophily and degree. PNAS, 105(35):12758--12762, September 2008.Google ScholarGoogle ScholarCross RefCross Ref
  7. Facebook. http://www.facebook.com.Google ScholarGoogle Scholar
  8. A.T. Fiore and J.S. Donath. Homophily in online dating: when do you like someone like yourself? In Proc. CHI'05, Portland, USA, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A.L.N. Fred and A.K. Jain. Robust data clustering. In Proc. CVPR'03, pages 128--133, June 2003.Google ScholarGoogle Scholar
  10. L. Friedland and D. Jensen. Finding tribes: identifying close-knit individuals from employment patterns. In Proc. KDD'07, San Jose, California, USA, Aug 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Jensen and J. Neville. Data mining in social networks. In Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, pages 287--302, 2003.Google ScholarGoogle Scholar
  12. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, 51(3):497--515, May 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. F. Luo, J.Z. Wang, and E. Promislow. Exploring local community structures in large networks. Web Intelligent and Agent Systems, 6(4):387--400, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Lusseau and M.E.J. Newman. Identifying the role that individual animals play in their social network. Proc. R. Soc. London B, 271:S477, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  15. A. Mislove, M. Marcon, K.P. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and Analysis of Online Social Networks. In Proc. IMC'07, San Diego, CA, October 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M.E.J. Newman. Birds of a feather: Homophily in social networks. Annual Review of Sociology, 27:415--444, August 2001.Google ScholarGoogle ScholarCross RefCross Ref
  17. M.E.J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69(6), 2004.Google ScholarGoogle ScholarCross RefCross Ref
  18. M.E.J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  19. F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Parisi. Defining and identifying communities in networks. PNAS, 101(9):2658--2663, March 2004.Google ScholarGoogle ScholarCross RefCross Ref
  20. Rice Culture. http://www.professor.rice.edu/professor/Rice_Culture.asp?SnID=165470151.Google ScholarGoogle Scholar
  21. Rice University Alumni Directory. https://online.alumni.rice.edu/directory/detailsearch.asp.Google ScholarGoogle Scholar
  22. Rice University Student Directory. http://www.rice.edu/search/query.php?advanced=1&tab=people.Google ScholarGoogle Scholar
  23. J.R. Tyler, D.M. Wilkinson, and B.A. Huberman. Email as spectroscopy: Automated discovery of community structure within organizations. In Proc. ICCT'03, Dordrecht, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. E. Zheleva and L. Getoor. To join or not to join: The illusion of privacy in social networks with mixed public and private user profiles. In Proc. WWW'09, Madrid, Spain, May 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. You are who you know: inferring user profiles in 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
          WSDM '10: Proceedings of the third ACM international conference on Web search and data mining
          February 2010
          468 pages
          ISBN:9781605588896
          DOI:10.1145/1718487

          Copyright © 2010 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: 4 February 2010

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate498of2,863submissions,17%

          Upcoming Conference

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader