The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Statistical mechanics of complex networks
Statistical mechanics of complex networks
On finding graph clusterings with maximum modularity
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Computing communities in large networks using random walks
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
An O(n2) algorithm for detecting communities of unbalanced sizes in large scale social networks
Knowledge-Based Systems
| Hi-index | 0.00 |
This article is about community detection algorithms in graphs. First a new method will be introduced, which is based on an extension [16] of the commonly used modularity [17, 18, 19, 20] and gives overlapping communities. We list and compare the results given by our new method and some other algorithms yileding either overlapping or non-overlapping communities. While the main use of the proposed algorithm is benchmarking, we also consider the possibility of hot starts, and some further extensions that considers the degree distribution of the graphs.