Sign prediction and community detection in directed signed networks based on random walk theory

2019 ◽  
Vol 11 (2) ◽  
pp. 200
Author(s):  
Yuanjie Zheng ◽  
Hong Wang ◽  
Baofang Hu
2017 ◽  
Vol 31 (15) ◽  
pp. 1750121 ◽  
Author(s):  
Fang Hu ◽  
Youze Zhu ◽  
Yuan Shi ◽  
Jianchao Cai ◽  
Luogeng Chen ◽  
...  

In this paper, based on Walktrap algorithm with the idea of random walk, and by selecting the neighbor communities, introducing improved signed probabilistic mixture (SPM) model and considering the edges within the community as positive links and the edges between the communities as negative links, a novel algorithm Walktrap-SPM for detecting overlapping community is proposed. This algorithm not only can identify the overlapping communities, but also can greatly increase the objectivity and accuracy of the results. In order to verify the accuracy, the performance of this algorithm is tested on several representative real-world networks and a set of computer-generated networks based on LFR benchmark. The experimental results indicate that this algorithm can identify the communities accurately, and it is more suitable for overlapping community detection. Compared with Walktrap, SPM and LMF algorithms, the presented algorithm can acquire higher values of modularity and NMI. Moreover, this new algorithm has faster running time than SPM and LMF algorithms.


2011 ◽  
Vol 655 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Ian J. Cutress ◽  
Edmund J.F. Dickinson ◽  
Richard G. Compton

Sign in / Sign up

Export Citation Format

Share Document