An algorithm J-SC of detecting communities in complex networks

DOI10.1016/J.PHYSLETA.2017.09.013zbMath1376.91130OpenAlexW2755831122MaRDI QIDQ1681625

Yanran Wang, Mingzhu Wang, Fang Hu, Zhehao Hong, Yan-hui Zhu

Publication date: 24 November 2017

Published in: Physics Letters. A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physleta.2017.09.013

zbMATH Keywords

modularitycommunity detectionsimulation experimentJ-SC algorithmnormal mutual information

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (2)

Computing communities in complex networks using the Dirichlet processing Gaussian mixture model with spectral clustering ⋮ Overlapping community detection based on conductance optimization in large-scale networks

Cites Work

• Weighted modularity optimization for crisp and fuzzy community detection in large-scale networks
• Community structure detection for directed networks through modularity optimisation
• Analyzing evolutionary optimization and community detection algorithms using regression line dominance
• A divisive spectral method for network community detection
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• First-principles multiway spectral partitioning of graphs
• Unnamed Item

This page was built for publication: An algorithm J-SC of detecting communities in complex networks