A graph compression based overlapping communities detection algorithm
From MaRDI portal
Publication:2993033
DOI10.3969/J.ISSN.1005-3026.2015.11.006zbMATH Open1349.91237MaRDI QIDQ2993033FDOQ2993033
Authors: Yuhai Zhao, Ying Yin, Xue Wang
Publication date: 10 August 2016
Recommendations
- Uncovering the overlapping community structure of complex networks by maximal cliques
- Overlapping community detection algorithm based on expansion of union gravitational degree in weighted networks
- A community detection algorithm based on graph compression for large-scale social networks
- Algorithm for detecting overlapping communities from complex network big data
- An overlapping community detection algorithm based on fuzzy hierarchical clustering in social networks
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cited In (5)
- Algorithm for detecting overlapping communities from complex network big data
- Overlapping community detection algorithm based on weak clique in multi-layer social networks
- A community detection algorithm based on graph compression for large-scale social networks
- An overlapping community detection algorithm based on fuzzy hierarchical clustering in social networks
- Complex network filtering and compression algorithm based on triangle-subgraph
This page was built for publication: A graph compression based overlapping communities detection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993033)