Showing 1 - 10 of 1,522
paper, we propose a parameter-free hierarchical network clustering algorithm DenShrink. By combining the advantages of … density-based clustering and modularity optimization methods, our algorithm can reveal the embedded hierarchical community …
Persistent link: https://www.econbiz.de/10010874677
additional nonnegative constraint into this graph clustering problem and design efficient algorithms to optimize the new …
Persistent link: https://www.econbiz.de/10010589173
clustering. Our approach is to consider network topology as well as interaction density when identifying overlapping and …
Persistent link: https://www.econbiz.de/10011077872
Persistent link: https://www.econbiz.de/10012618514
Persistent link: https://www.econbiz.de/10012271204
Persistent link: https://www.econbiz.de/10011672818
Graph clustering has been an essential part in many methods and thus its accuracy has a significant effect on many … circuits demands clustering algorithms with nearly-linear time and space complexity. In this paper we propose Personalized … PageRank Clustering (PPC) that employs the inherent cluster exploratory property of random walks to reveal the clusters of a …
Persistent link: https://www.econbiz.de/10010871970
Persistent link: https://www.econbiz.de/10014514770
Persistent link: https://www.econbiz.de/10014423853
A modularity-specialized label propagation algorithm (LPAm) for detecting network communities was recently proposed. This promising algorithm offers some desirable qualities. However, LPAm favors community divisions where all communities are similar in total degree and thus it is prone to get...
Persistent link: https://www.econbiz.de/10010589719