A New Random-Walk Based Label Propagation Community Detection Algorithm

Author(s):  
Chang Su ◽  
Xiaotao Jia ◽  
Xianzhong Xie ◽  
Yue Yu
2016 ◽  
Vol 2016 ◽  
pp. 1-15 ◽  
Author(s):  
Dongqing Zhou ◽  
Xing Wang

The paper addresses particle swarm optimization (PSO) into community detection problem, and an algorithm based on new label strategy is proposed. In contrast with other label propagation strategies, the main contribution of this paper is to design the definition of the impact of node and take it into use. Special initialization and update approaches based on it are designed in order to make full use of it. Experiments on synthetic and real-life networks show the effectiveness of proposed strategy. Furthermore, this strategy is extended to signed networks, and the corresponding objective function which is called modularity density is modified to be used in signed networks. Experiments on real-life networks also demonstrate that it is an efficacious way to solve community detection problem.


2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Min Ji ◽  
Dawei Zhang ◽  
Fuding Xie ◽  
Ying Zhang ◽  
Yong Zhang ◽  
...  

Many applications show that semisupervised community detection is one of the important topics and has attracted considerable attention in the study of complex network. In this paper, based on notion of voltage drops and discrete potential theory, a simple and fast semisupervised community detection algorithm is proposed. The label propagation through discrete potential transmission is accomplished by using voltage drops. The complexity of the proposal isOV+Efor the sparse network withVvertices andEedges. The obtained voltage value of a vertex can be reflected clearly in the relationship between the vertex and community. The experimental results on four real networks and three benchmarks indicate that the proposed algorithm is effective and flexible. Furthermore, this algorithm is easily applied to graph-based machine learning methods.


Sign in / Sign up

Export Citation Format

Share Document