• DocumentCode
    641076
  • Title

    Finding groups of friends who are significant across multiple domains in social networks

  • Author

    Tanbeer, Syed K. ; Fan Jiang ; Leung, Carson Kai-Sang ; MacKinnon, Richard Kyle ; Medina, Irish J. M.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Manitoba, Winnipeg, MB, Canada
  • fYear
    2013
  • fDate
    12-14 Aug. 2013
  • Firstpage
    21
  • Lastpage
    26
  • Abstract
    Social networking websites such as Facebook, LinkedIn, Twitter, and Weibo have been used for collaboration and knowledge sharing between users. The mining of social network data has become an important topic in data mining and computational aspects of social networks. Nowadays, it is not uncommon for most users in a social network to have many friends and in multiple social domains. Among these friends, some groups of friends are more significant than others. In this paper, we introduce a data mining technique that helps social network users find groups of friends who are significant across multiple domains in social networks.
  • Keywords
    data mining; information retrieval; social networking (online); data mining technique; friends; social network users; social networking Websites; Computers; Data mining; Applications on social networks; computational aspects of social networks; knowledge discovery and data mining; social computing; social network analysis and mining;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Aspects of Social Networks (CASoN), 2013 Fifth International Conference on
  • Conference_Location
    Fargo, ND
  • Print_ISBN
    978-1-4799-1407-4
  • Type

    conf

  • DOI
    10.1109/CASoN.2013.6622608
  • Filename
    6622608