A new scalable leader-community detection approach for community detection in social networks

Abstract Studying social influence in networks is crucial to understand how behavior spreads. An interesting number of theories were elaborated to analyze how innovations and trends get adopted. The traditional view assumes that a minority of members in a society possess qualities that make them exceptionally persuasive in spreading ideas to others. These exceptional individuals drive trends on behalf of the majority of ordinary people. They are loosely described as being informed, respected, and well connected. The leaders or influential are responsible for the dissemination of information and the propagation of influence. In this paper, we propose a new scalable and a deterministic approach for the detection of communities using leaders nodes named Leader-Community Detection Approach LCDA. The proposed approach has two main steps. The first step is the leaders’ retrieval. The second step is the community detection using similarity between nodes. Our algorithms provide good results compared to ground truth membership community.

[1]  Jun Ma,et al.  Ranking the spreading ability of nodes in complex networks based on local structure , 2014 .

[2]  Carl T. Bergstrom,et al.  The map equation , 2009, 0906.1405.

[3]  Yanchi Liu,et al.  Community detection in graphs through correlation , 2014, KDD.

[4]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[5]  Li She,et al.  Effectively identifying the influential spreaders in large-scale social networks , 2014, Multimedia Tools and Applications.

[6]  Osmar R. Zaïane,et al.  Top Leaders Community Detection Approach in Information Networks , 2010 .

[7]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[9]  Chung-Yuan Huang,et al.  Identifying Super-Spreader Nodes in Complex Networks , 2015 .

[10]  Hassan Badir,et al.  LeadersRank: Towards a new approach for community detection in social networks , 2015, 2015 IEEE/ACS 12th International Conference of Computer Systems and Applications (AICCSA).

[11]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[12]  Jennifer Widom,et al.  Exploiting hierarchical domain structure to compute similarity , 2003, TOIS.

[13]  S. Karthik,et al.  A survey on semantic similarity between words in semantic web , 2012, 2012 International Conference on Radar, Communication and Computing (ICRCC).

[14]  Britta Ruhnau,et al.  Eigenvector-centrality - a node-centrality? , 2000, Soc. Networks.

[15]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[16]  Mark E. J. Newman,et al.  Community detection and graph partitioning , 2013, ArXiv.

[17]  Ying Fan,et al.  Identifying and Characterizing Nodes Important to Community Structure Using the Spectrum of the Graph , 2011, PloS one.

[18]  Luciano da Fontoura Costa,et al.  The role of centrality for the identification of influential spreaders in complex networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  Sangwook Kim,et al.  Identifying and ranking influential spreaders in complex networks by neighborhood coreness , 2014 .

[20]  Daniel T. Blumstein,et al.  Are social attributes associated with alarm calling propensity , 2015 .

[21]  Rokia Missaoui,et al.  Social Network Analysis - Community Detection and Evolution , 2015, Lecture Notes in Social Networks.

[22]  M. Newman.  Analysis of weighted networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Hassan Badir,et al.  R ESEARCHES DETECTION OF LEADER ' S NODES IN COMPLEX NETWORKS , 2015 .

[24]  Jingyu Zhou,et al.  Preference-based mining of top-K influential nodes in social networks , 2014, Future Gener. Comput. Syst..

[25]  Cun-Quan Zhang,et al.  “Follow the Leader”: A Centrality Guided Clustering and Its Application to Social Network Analysis , 2013, TheScientificWorldJournal.

[26]  Devavrat Shah,et al.  Community Detection in Networks: The Leader-Follower Algorithm , 2010, ArXiv.

[27]  S.,et al.  An Efficient Heuristic Procedure for Partitioning Graphs , 2022 .

[28]  Benjamin Renoust,et al.  Analyse et visualisation de l'intrication d'arêtes dans les réseaux multiplex. (Analysis and Visualisation of Edge Entanglement in Multiplex Networks) , 2013 .

[29]  P.-H. Maucorps.  Moreno (J.L.) - Fondements de la sociométrie. Traduit d'après la seconde édition américaine (Who Shall Survive?) par H. Lesage et P.-H. Maucorps , 1955 .

[30]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[31]  D. R. White,et al.  Structural cohesion and embeddedness: A hierarchical concept of social groups , 2003 .

[32]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[34]  Boleslaw K. Szymanski,et al.  Overlapping community detection in networks: The state-of-the-art and comparative study , 2011, CSUR.