Fast Markov Clustering Algorithm Based on Belief Dynamics

Graph clustering is one of the most significant, challenging, and valuable topic in the analysis of real complex networks. To detect the cluster configuration accurately and efficiently, we propose a new Markov clustering algorithm based on the limit state of the belief dynamics model. First, we pre...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on cybernetics Jg. 53; H. 6; S. 3716 - 3725
Hauptverfasser: Li, Huijia, Xu, Wenzhe, Qiu, Chenyang, Pei, Jian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.06.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Belief dynamics
Broadcasting
Clustering
Clustering algorithms
complex networks
Computational complexity
Configurations
Convergence
Dynamics
Heuristic algorithms
large-scale networks
Limit states
Markov clustering algorithm
Markov processes
Networks
Trajectory
ISSN:2168-2267, 2168-2275, 2168-2275
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Graph clustering is one of the most significant, challenging, and valuable topic in the analysis of real complex networks. To detect the cluster configuration accurately and efficiently, we propose a new Markov clustering algorithm based on the limit state of the belief dynamics model. First, we present a new belief dynamics model, which focuses beliefs of multicontent and randomly broadcasting information. A strict proof is provided for the convergence of nodes' normalized beliefs in complex networks. Second, we introduce a new Markov clustering algorithm (denoted as BMCL) by employing a belief dynamics model, which guarantees the ideal cluster configuration. Following the trajectory of the belief convergence, each node is mapped into the corresponding cluster repeatedly. The proposed BMCL algorithm is highly efficient: the convergence speed of the proposed algorithm researches <inline-formula> <tex-math notation="LaTeX">O(TN) </tex-math></inline-formula> in sparse networks. Last, we implement several experiments to evaluate the performance of the proposed methods.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:2168-2267
2168-2275
2168-2275
DOI:10.1109/TCYB.2022.3141598