• DocumentCode
    3658882
  • Title

    Social boundary of any two nodes in a social network

  • Author

    Shilin Fan;Ping Li;Yan Chen;Lixue Chen

  • Author_Institution
    Center for Intelligent and Networked Systems, School of Computer Science, Southwest Petroleum University, Chengdu 610500, P.R. China
  • fYear
    2015
  • fDate
    7/1/2015 12:00:00 AM
  • Firstpage
    202
  • Lastpage
    207
  • Abstract
    It is generally accepted that the driving forces of establishing connections among people are social influence and homophily. Both of them eventually lead to the proximity of any two related individuals to some extent. However, a person always can be featured with some attributes different from his/her social networking partners. Accordingly, one person´s direct and indirect social relationships are likely to intersect with others at some nodes in social networks. In this work, we study the novel task of identifying the hidden boundary that divides the social network into disjoint social circles according to any pair of nodes which we call social boundary. We put forward two methods to separate the social circles of any two nodes and thus can find out the social boundary. One is based on label propagation and the other is based on perceptron network model. We apply the methods on synthetic and real networks, respectively. Finally, we demonstrate the areas in which it would be applied.
  • Keywords
    "Conferences","Random access memory","Training","Prediction algorithms","Presses","Facebook"
  • Publisher
    ieee
  • Conference_Titel
    Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM), 2015 IEEE 7th International Conference on
  • Print_ISBN
    978-1-4673-7337-1
  • Electronic_ISBN
    2326-8239
  • Type

    conf

  • DOI
    10.1109/ICCIS.2015.7274573
  • Filename
    7274573