A guided tour through the main aspects of community detection in networks is offered, pointing out strengths and weaknesses of popular methods, and giving directions to their use.
Authors
S. Fortunato
2 papers
Darko Hric
1 papers
References280 items
1
Random Graphs
2
Communities
3
Social Network Analysis
4
Points of Significance: Clustering
5
Higher-order organization of complex networks
6
Maps of sparse Markov chains efficiently reveal community structure in network flows with memory
7
Community detection in networks: Modularity optimization and maximum likelihood are equivalent
8
Estimating the number of communities in a network
9
Metrics for Community Analysis
10
Network structure, metadata and the prediction of missing nodes
11
Eigenvector dynamics under perturbation of modular networks
12
Modelling sequences and temporal networks with dynamic community structures
13
Community detection in networks with unequal groups
14
Hierarchical mutual information for the comparison of hierarchical community structures in complex networks
15
Structure and inference in annotated networks
16
A First Course in Network Theory
17
On comparing partitions
18
Inferring the mesoscale structure of layered, edge-valued, and time-varying networks.
19
Modular Deconstruction Reveals the Dynamical and Physical Building Blocks of a Locomotion Motor Program
20
Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
21
Finding communities in sparse networks
22
Plos One
23
A benchmark model to assess community structure in evolving networks
24
Evaluating accuracy of community detection using the relative normalized mutual information
25
Clustering attributed graphs: Models, measures and methods
26
Social Network Analysis
27
Identification of core-periphery structure in networks
28
Model selection and hypothesis testing for large-scale network models with overlapping groups
29
The structure and dynamics of multilayer networks
30
Community detection in networks: Structural communities versus ground truth
31
Erratum: Community detection algorithms: A comparative analysis [Phys. Rev. E 80, 056117 (2009)]
32
Learning Latent Block Structure in Weighted Networks
33
Structure and Overlaps of Ground-Truth Communities in Networks
34
Scalable detection of statistically significant communities and hierarchies, using message passing for modularity
35
Think Locally, Act Locally: The Detection of Small, Medium-Sized, and Large Communities in Large Networks
36
Efficiently inferring community structure in bipartite networks
37
Active discovery of network roles for predicting the classes of network nodes
38
Community Detection in Networks with Node Attributes
39
Improving the performance of algorithms to find communities in networks
40
Community detection for correlation matrices
41
Hierarchical block structures and high-resolution model selection in large networks
42
Multilayer networks
43
Spectral community detection in sparse networks
44
Clustering and Community Detection in Directed Networks: A Survey
45
Spectral redemption in clustering sparse networks
46
Memory in network flows and its effects on spreading dynamics and community detection
47
Active Semi-supervised Community Detection Algorithm with Label Propagation
48
Overlapping community detection at scale: a nonnegative matrix factorization approach
49
Proceedings of the sixth ACM international conference on Web search and data mining
50
Parsimonious module inference in large networks.
51
Community-Affiliation Graph Model for Overlapping Network Community Detection
52
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
53
Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
54
Defining and evaluating network communities based on ground-truth
55
Graph spectra and the detectability of community structure in networks
56
Consensus clustering in complex networks
57
Towards Linear Time Overlapping Community Detection in Social Networks
58
Comparing network covers using mutual information
59
Hierarchical Multiresolution Method to Overcome the Resolution Limit in Complex Networks
60
Communities, modules and large-scale structure in networks
61
The Structure of Complex Networks: Theory and Applications
62
Overlapping community detection in networks: The state-of-the-art and comparative study
63
Normalized Mutual Information to evaluate overlapping community finding algorithms
64
A classification for community discovery methods in complex networks
65
Towards Online Multiresolution Community Detection in Large-Scale Networks
66
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, August 21-24, 2011
67
Active learning for node classification in assortative and disassortative networks
68
Temporal Networks
69
Limits of modularity maximization in community detection
70
Compression of flow can reveal overlapping modular organization in networks
71
An efficient and principled method for detecting communities in networks
72
Narrow scope for resolution-limit-free community detection.
73
Social Structure of Facebook Networks
74
Phase transition in the detection of modules in sparse networks
75
Uncovering space-independent communities in spatial networks
76
Finding Statistically Significant Communities in Networks
77
Multilevel Compression of Random Walks on Networks Reveals Hierarchical Organization in Large Integrated Systems
78
Clique graphs and overlapping communities
79
Bayesian data analysis.
80
Stochastic blockmodels and community structure in networks
81
Taxonomies of networks from community structure.
82
Characterizing the Community Structure of Complex Networks
83
Detecting communities of triangles in complex networks using spectral optimization
84
Networks: An Introduction
85
Bursts: The Hidden Pattern Behind Everything We Do
86
Missing and spurious interactions and the reconstruction of complex networks
87
Variational Bayesian inference and complexity control for stochastic block models
88
Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
89
Performance of modularity maximization in practical contexts.
90
Community detection algorithms: a comparative analysis: invited presentation, extended abstract
91
A Fuzzy Variant of the Rand Index for Comparing Clustering Structures
92
Community detection in graphs
93
Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.
94
The function of communities in protein interaction networks at multiple scales
95
Link communities reveal multiscale complexity in networks
96
Line graphs, link partitions, and overlapping communities.
97
Communities in Networks
98
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
99
Stability of graph communities across time scales
100
Mapping Change in Large Networks
101
Multiresolution community detection for megascale networks by information-based replica correlations.
102
Fast online graph clustering via Erdös-Rényi mixture
103
Community detection in networks with positive and negative links.
104
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
105
Dynamical Processes on Complex Networks
106
Comparing Community Structure to Characteristics in Online Collegiate Social Networks
107
A mixture model for random graphs
108
Benchmark graphs for testing community detection algorithms.
109
Facetnet: a framework for analyzing communities and their evolutions in dynamic networks
110
Local resolution-limit-free Potts model for community detection.
111
Fast unfolding of communities in large networks
112
Detecting the overlapping and hierarchical community structure in complex networks
113
Comparative definition of community and corresponding identifying algorithm.
114
On Modularity Clustering
115
Consensus Clustering Algorithms: Comparison and Refinement
116
Scale-free networks
117
THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH
118
A tutorial on spectral clustering
119
Motif-based communities in complex networks
120
Robustness of community structure in networks.
121
Near linear time algorithm to detect community structures in large-scale networks.
122
An event-based framework for characterizing the evolutionary behavior of interaction graphs
123
Evolutionary spectral clustering by incorporating temporal smoothness
124
Graph clustering
125
Modularity and community detection in bipartite networks.
126
Maps of random walks on complex networks reveal community structure
127
Large Scale Structure and Dynamics of Complex Networks: From Information Technology to Finance and Natural Science
128
Mixed Membership Stochastic Blockmodels
129
Comparing clusterings---an information based distance
130
Quantifying social group evolution
131
Analysis of the structure of complex networks at different resolution levels
132
Model‐based clustering for social networks
133
Mixture models and exploratory analysis in networks
134
Evolutionary clustering
135
Detecting complex network modularity by dynamical clustering.
136
Resolution limit in community detection
137
Community detection as an inference problem.
138
Statistical mechanics of community detection.
139
Modularity and community structure in networks.
140
Dynamic social network analysis using latent space models
141
Clustering ensembles: models of consensus and weak partitions
142
Online Analysis of Community Evolution in Data Streams
143
Synchronization reveals topological scales in complex networks.
144
Geographic routing in social networks
145
Comparing clusterings: an axiomatic view
146
Uncovering the overlapping community structure of complex networks in nature and society
147
Comparing community structure identification
148
Community structure identification
149
Finding local community structure in networks.
150
Functional cartography of complex metabolic networks
151
Evolution of Networks: From Biological Nets to the Internet and WWW
152
Finding community structure in very large networks.
153
Analysis of weighted networks.
154
Network Brownian Motion: A New Method to Measure Vertex-Vertex Proximity and to Identify Communities and Subcommunities
155
Tracking evolving communities in large linked networks
156
Modularity from fluctuations in random graphs and complex networks.
157
Finding communities in linear time: a physics approach
158
Fast algorithm for detecting community structure in networks.
159
Defining and identifying communities in networks.
160
Finding and evaluating community structure in networks.
161
The emergent properties of a dolphin social network
162
Robust data clustering
163
Scale-free networks.
164
Distance, dissimilarity index, and network community structure.
165
Network landscape from a Brownian particle's perspective.
166
Structural Cohesion and Embeddedness: A Hierarchical Concept of Social Groups
167
Community structure in social and biological networks
168
A Stability Based Method for Discovering Structure in Clustered Data
169
Graph clustering by flow simulation
170
Data clustering: a review
171
Algorithms for graph partitioning on the planted partition model
172
Internet: Diameter of the World-Wide Web
173
The pacific symposium on biocomputing
174
Spin Glasses
175
The Anatomy of a Large-Scale Hypertextual Web Search Engine
176
The Spin Glass
177
A Critical Point for Random Graphs with a Given Degree Sequence
178
The maximum clique problem
179
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time
180
Omega: A General Formulation of the Rand Index of Cluster Recovery Suitable for Non-disjoint Solutions.
181
Social Network Analysis
182
Information Theory
183
Graph bisection algorithms with good average case behavior
184
Stochastic blockmodels: First steps
185
A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs
186
Cliques, clubs and clans
187
Modeling By Shortest Data Description*
188
An Information Flow Model for Conflict and Fission in Small Groups
189
MEASURING AGREEMENT WHEN TWO OBSERVERS CLASSIFY PEOPLE INTO CATEGORIES NOT DEFINED IN ADVANCE
190
Algorithm 457: finding all cliques of an undirected graph
191
A graph‐theoretic definition of a sociometric clique†
192
Natural Scales in Geographical Patterns
193
On the Decomposition of Networks in Minimally Interconnected Subnetworks
194
Cliques
195
Connectivity and generalized cliques in sociometric group structure
196
A method of matrix analysis of group structure
197
Graph Clustering
198
Nat. Commun
199
Stéphane Robin
200
Database Systems for Advanced Applications
201
Neuron
202
Modeling sequences and temporal networks with dynamic community structures
203
Netw. Sci
204
J. Complex Netw
205
ACM Trans. Intell. Syst. Technol
206
Handbook of combinatorial optimization
207
ACM Comput. Surv
208
Sci. Rep
209
Nat. Phys
210
Int. J. Bifurcat. Chaos
211
Stat. Modelling
212
Bursts : the hidden patterns behind everything we do, from your e-mail to bloody crusades
213
Social Network Data Analytics
214
Community Discovery in Social Networks: Applications, Methods and Emerging Trends
215
Evolution in Social Networks: A Survey
216
Stat. Anal. Data Min
217
SIAM Review
218
Complex Networks: Spectral properties, transport, diffusion and dynamics
219
Electron – molecule collision calculations using the R-matrix method
220
BMC Syst. Biol
221
Internet Math
222
A Bayesian Approach Toward Finding Communities and Their Evolutions in Dynamic Social Networks
223
Exactly Solved Models
224
Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference , IFSA-EUSFLAT 2009
225
Notices Amer. Math. Soc
226
IEEE Trans. Knowl. Data Eng
227
KDD '07: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
228
J. Multivar. Anal
229
Phys. Rev. E
230
Experiments on comparing graph clusterins
231
Finding communities by clustering a graph into overlapping subgraphs
232
IADIS AC, edited by N. Guimaraes and P. T. Isaias (IADIS)
233
International Symposium on Computer and Information Sciences
234
ACM SIGKDD Explor. Newsl
235
Proc. Natl. Acad. Sci. USA 102(33)
236
Proc. of SIAM Int. Conf. on Data Mining (SDM) (SIAM)
237
J. Stat. Mech
238
Information Theory, Inference, and Learning Algorithms
239
An Experimental Comparison of Model-Based Clustering Methods
240
Eur. Phys. J. B
241
Am. Sociol. Rev
242
Proc. Royal Soc. London B
243
Proceedings. 2003 IEEE Computer Society Conference on (IEEE)
244
Cluster Ensembles --- A Knowledge Reuse Framework for Combining Multiple Partitions
245
Random Struct. Algor
246
Mach. Learn
247
Nature
248
Comput. Netw. ISDN
249
Estimation and Prediction for Stochastic Blockmodels for Graphs with Latent Block Structure
250
J. Classif
251
The Architecture of Complexity
252
J. Algorithms
253
Spin Glass Theory and Beyond
254
Combinatorica
255
On the evolution of random graphs
256
The evolution of random graphs
257
Exactly solved models in statistical mechanics
258
Categorical Data Analysis of Single Sociometric Relations
259
Sociol. Methodol
260
Eur. J. Combin
261
Qual. Quant
262
A graph‐theoretic generalization of the clique concept*
263
Automatica
264
J. Anthropol. Res
265
Br. J. Math. Stat. Psychol
266
Finding all cliques of an undirected graph
267
Some methods for classification and analysis of multivariate observations
268
Proc. of the fifth Berkeley Symposium on Mathematical Statistics and Probability
269
Proc. Am. Phil. Soc
270
Publ. Math. Inst. Hungar. Acad. Sci
271
Publ. Math. Debrecen
272
Psychometrika
273
Etude comparative de la distribution florale dans une portion des Alpes et des Jura
274
Bull. Soc. Vaud. Sci. Nat
275
IEEE Trans. Pattern Anal. Mach. Intell
276
Lect. Notes Comp. Sci
277
network structure?
278
Journal of Graph Algorithms and Applications Computing Communities in Large Networks Using Random Walks