A community detection algorithm based on graph compression for large-scale social networks
Authors:
- Xingwang ZhaoXZXingwang Zhao
- Jiye LiangJLJiye Liang
- Jie WangJWJie Wang
Top Cited Papers
- 1 April 2021
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 551, 358-372
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China
This publication has 38 references indexed in Scilit:
- Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix FactorizationNeural Computation, 2012
- Detecting network communities by propagating labels under constraintsPhysical Review E, 2009
- Fast unfolding of communities in large networksJournal of Statistical Mechanics: Theory and Experiment, 2008
- Model-Based Clustering for Social NetworksJournal of the Royal Statistical Society Series A: Statistics in Society, 2007
- Graph evolutionACM Transactions on Knowledge Discovery From Data, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Fast algorithm for detecting community structure in networksPhysical Review E, 2004
- Friends and neighbors on the WebSocial Networks, 2003
- Power-Law Distribution of the World Wide WebScience, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000