A community detection algorithm based on graph compression for large-scale social networks
From MaRDI portal
Publication:2126256
Recommendations
- An analysis and comparison of community detection algorithms in online social networks
- A graph compression based overlapping communities detection algorithm
- A community extraction algorithm for large-scale online social networks
- MDPCluster: a swarm-based community detection algorithm in large-scale graphs
- scientific article; zbMATH DE number 7234180
Cites work
- 10.1162/153244303321897735
- Community detection with the label propagation algorithm: a survey
- Community structure in social and biological networks
- Efficient and effective community search
- Graph clustering
- Local community detection in multilayer networks
- Nonnegative matrix factorization with mixed hypergraph regularization for community detection
Cited in
(20)- A graph compression based overlapping communities detection algorithm
- MDPCluster: a swarm-based community detection algorithm in large-scale graphs
- A community extraction algorithm for large-scale online social networks
- A sentiment analysis-based two-stage consensus model of large-scale group with core-periphery structure
- LeaDCD: leadership concept-based method for community detection in social networks
- A parallel computing hierarchical community approach based on weighted-graph
- Improvement of path analysis algorithm in social networks based on HBase
- High-performance community detection in social networks using a deep transitive autoencoder
- Social relationship mining algorithm by multi-dimensional graph structural clustering
- Hybrid quantum swarm intelligence indexing for event detection in social networks
- Towards quantum computing based community detection
- Dynamic community detection based on information flow analysis
- Stable structural clustering in uncertain graphs
- Effects of hidden users on cascade-based community detection
- An analysis and comparison of community detection algorithms in online social networks
- Community detection for multilayer weighted networks
- Graph clustering using triangle-aware measures in large networks
- Information diffusion-aware likelihood maximization optimization for community detection
- DPC-FSC: an approach of fuzzy semantic cells to density peaks clustering
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
This page was built for publication: A community detection algorithm based on graph compression for large-scale social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2126256)