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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on cybernetics Ročník 53; číslo 6; s. 3716 - 3725
Hlavní autori:	Li, Huijia, Xu, Wenzhe, Qiu, Chenyang, Pei, Jian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	United States IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!