Genetic algorithm-based community detection in large-scale social networks

2019 ◽  
Vol 32 (13) ◽  
pp. 9649-9665 ◽  
Author(s):  
Ranjan Kumar Behera ◽  
Debadatta Naik ◽  
Santanu Kumar Rath ◽  
Ramesh Dharavath
Author(s):  
S Rao Chintalapudi ◽  
M. H. M. Krishna Prasad

Community Structure is one of the most important properties of social networks. Detecting such structures is a challenging problem in the area of social network analysis. Community is a collection of nodes with dense connections than with the rest of the network. It is similar to clustering problem in which intra cluster edge density is more than the inter cluster edge density. Community detection algorithms are of two categories, one is disjoint community detection, in which a node can be a member of only one community at most, and the other is overlapping community detection, in which a node can be a member of more than one community. This chapter reviews the state-of-the-art disjoint and overlapping community detection algorithms. Also, the measures needed to evaluate a disjoint and overlapping community detection algorithms are discussed in detail.


2020 ◽  
Vol 10 (9) ◽  
pp. 3126
Author(s):  
Desheng Lyu ◽  
Bei Wang ◽  
Weizhe Zhang

With the development of network technology and the continuous advancement of society, the combination of various industries and the Internet has produced many large-scale complex networks. A common feature of complex networks is the community structure, which divides the network into clusters with tight internal connections and loose external connections. The community structure reveals the important structure and topological characteristics of the network. The detection of the community structure plays an important role in social network analysis and information recommendation. Therefore, based on the relevant theory of complex networks, this paper introduces several common community detection algorithms, analyzes the principles of particle swarm optimization (PSO) and genetic algorithm and proposes a particle swarm-genetic algorithm based on the hybrid algorithm strategy. According to the test function, the single and the proposed algorithm are tested, respectively. The results show that the algorithm can maintain the good local search performance of the particle swarm optimization algorithm and also utilizes the good global search ability of the genetic algorithm (GA) and has good algorithm performance. Experiments on each community detection algorithm on real network and artificially generated network data sets show that the particle swarm-genetic algorithm has better efficiency in large-scale complex real networks or artificially generated networks.


2020 ◽  
Vol 38 (2) ◽  
pp. 1663-1674
Author(s):  
Muhammad Abulaish ◽  
Ishfaq Majid Bhat ◽  
Sajid Yousuf Bhat

2016 ◽  
Vol 26 (6) ◽  
pp. 625-641 ◽  
Author(s):  
Simrat Kaur ◽  
Sarbjeet Singh ◽  
Sakshi Kaushal ◽  
Arun Kumar Sangaiah

Sign in / Sign up

Export Citation Format

Share Document