CILPA: a cohesion index based label propagation algorithm for unveiling communities in complex social networks

被引:2
作者
Raju E. [1 ]
Ramadevi Y. [2 ]
Sravanthi K. [3 ]
机构
[1] Department of CSE, SR Engineering College, Warangal, Telangana
[2] Department of CSE, Chaitanya Bharathi Institute of Technology, Hyderabad, Telangana
[3] Department of CSE, University College of Engineering, Kakatiya University, Kothagudem, Telangana
关键词
Cohesion index; Cohesion similarity; Community detection; Label propagation; Social networks;
D O I
10.1007/s41870-018-0190-4
中图分类号
学科分类号
摘要
Social network analysis is the process of recording various patterns of interactions between a set of social entities. An important phenomenon that draws the attention of analysis is the emergence of communities in these networks. The understanding and identifying communities in these networks is challenging and has gained much importance these days. There are many approaches suggested to identify communities in social networks, and most of them are time consuming when implemented or need some important user-input parameters. In this paper, a new label propagation algorithm named CILPA (Cohesion Index based Label Propagation Algorithm) is proposed. The algorithm brings in two new functions, called Cohesion Similarity (CoSim) and Cohesion Index (CI). The cohesion index function measures cohesiveness of nodes and similarity with neighbor nodes is measured using cohesion similarity. Cohesion index as the base, we propose a new label propagation algorithm with precise node update sequence and node priority. Prior information about the number of communities is not required in our algorithm and the results show that the quality of communities obtained by CILPA are very stable and better than those detected by original LPA. Results of experiments conducted on real world networks demonstrate the efficiency of our approach and indicate that cohesion index calculation of nodes improves the accuracy and CILPA is an efficient method for unveiling communities in complex social networks. © 2018, Bharati Vidyapeeth's Institute of Computer Applications and Management.
引用
收藏
页码:435 / 445
页数:10
相关论文
共 32 条
[21]  
Clauset A., Finding local community structure in networks, Phys Rev E Stat Nonlin Soft Matter Phys, 72, 2, pp. 254-271, (2005)
[22]  
Ester M., Kriegel H.P., Sander J., Xu X., A density-based algorithm for discovering clusters in large spatial databases with noise, Knowledge Discovery and Data Mining, 96, pp. 226-231, (1996)
[23]  
Ankerst M., Breunig M.M., Kriegel H.P., Sander J., OPTICS: Ordering points to identify the clustering structure, International Conference on Management of Data, 28, pp. 49-60, (1999)
[24]  
Raghavan U.N., Albert R., Kumara S., Near linear time algorithm to detect community structures in large-scale networks, Phys Rev E, 76, 3, (2007)
[25]  
Newman M.E.J., Fast algorithm for detecting community structure in networks, Phys Rev E, 69, (2004)
[26]  
Xie J., Szymanski B.K., Community detection using a neighborhood strength driven label propagation algorithm, IEEE Network Science Workshop, 2011, pp. 188-195, (2011)
[27]  
Leung I., Hui P., Lio P., Crowcroft J., Towards real-time community detection in large networks, Phys Rev E, 79, (2009)
[28]  
Gregory S., Finding overlapping communities in networks by label propagation, New J Phys, 12, (2010)
[29]  
Xie J., Szymanski B.K., Towards linear time overlapping community detection in social networks, In PAKDD, pp. 25-36, (2012)
[30]  
Zachary W.W., An information flow model for conflict and fission in small groups, J Anthropol Res, 33, pp. 452-473, (1977)