z-logo
open-access-imgOpen Access
A Markov Chain-Based Overlapping Community Detection Algorithm for Complex Networks
Author(s) -
Ruifang Xing,
Yayun Fan,
Wei Liu
Publication year - 2019
Publication title -
ingénierie des systèmes d information
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.161
H-Index - 8
eISSN - 2116-7125
pISSN - 1633-1311
DOI - 10.18280/isi.240603
Subject(s) - markov chain , computer science , algorithm , machine learning
Received: 5 April 2019 Accepted: 2 August 2019 Most community detection algorithms for complex networks are focused on nonoverlapping communities. However, there are many overlapping communities in real-world complex networks. To solve the contradiction, this paper develops a novel overlapping community detection algorithm based on Markov chain. First, the input adjacency matrix was expanded to guide the information flow. Then, the inflation operation was implemented to enhance the weakening boundary of communities. After that, an adaptive threshold was introduced to reconstruct the matrix. The network corresponding to the reconstructed matrix displays the overlapping communities in the original network. The proposed algorithm was compared with several popular community detection algorithms on artificial and real-world networks. The results show that our algorithm achieved higher recognition accuracy and faster convergence than the contrastive algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom