Finding compact communities in large graphs

@article{Creusefond2015FindingCC,
  title={Finding compact communities in large graphs},
  author={Jean Creusefond and Thomas Largillier and Sylvain Peyronnet},
  journal={2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)},
  year={2015},
  pages={1457-1464}
}
This article presents an efficient hierarchical clustering algorithm that solves the problem of core community detection. It is a variant of the standard community detection problem in which we are particularly interested in the connected core of communities. To provide a solution to this problem, we question standard definitions on communities and provide alternatives. We propose a function called compactness, designed to assess the quality of a solution to this problem. Our algorithm is based… Expand
A LexDFS-Based Approach on Finding Compact Communities
TLDR
An efficient hierarchical clustering algorithm based on a graph traversal algorithm called LexDFS, which has the property of going through the clustered parts of the graph in a small number of iterations, making them recognisable. Expand
Graph Clustering Via Intra-Cluster Density Maximization
TLDR
This article forms the clustering problem as a combinatorial optimization problem that maximizes intra-cluster density, a statistically meaningful quantity, and requires the number of clusters, a softbound on cluster size and a penalty coefficient as parameter inputs. Expand
Metrics for Community Analysis: A Survey
TLDR
A comprehensive and structured overview of the start-of-the-art metrics used for the detection and the evaluation of community structure and conducts experiments on synthetic and real-world networks to present a comparative analysis of these metrics in measuring the goodness of the underlying community structure. Expand
Metrics for Community Analysis
TLDR
A survey of the start-of-the-art metrics used for the detection and the evaluation of community structure and a comparative analysis of these metrics in measuring the goodness of the underlying community structure is presented. Expand
Community detection methods can discover better structural clusters than ground-truth communities
TLDR
Most common methods in the literature for community detection are brought together in a comparative approach and their performances in both real-world networks and synthetic networks are revealed. Expand
On the Evaluation Potential of Quality Functions in Community Detection for Different Contexts
TLDR
A general methodology is applied to identify different contexts, i.e. groups of graphs where the quality functions behave similarly, and identifies the best quality functions whose results are consistent with expectations from real life applications. Expand
Silhouette for the Evaluation of Community Structures in Multiplex Networks
TLDR
A versatile definition of the silhouette is proposed, by generalizing it to encompass different scenarios of proximity between entities in a network, where the distance notion can be geodesic-based or homophily-oriented. Expand
Caractériser et détecter les communautés dans les réseaux sociaux. (Characterising and detecting communities in social networks)
TLDR
Mets a disposition un logiciel nomme CoDACom (Community Detection Algorithm Comparator, codacom.greyc.fr) permettant d'appliquer cette methodologie ainsi that d'utiliser un grand nombre d'outils de detection de communautes. Expand

References

SHOWING 1-10 OF 32 REFERENCES
On Modularity Clustering
TLDR
The conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts is proved and an Integer Linear Programming formulation is given. Expand
Empirical comparison of algorithms for network community detection
TLDR
Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior. Expand
A Unified View of Graph Searching
TLDR
This paper unifies the view of graph search algorithms by showing simple, closely related characterizations of various well-known search paradigms, including BFS and DFS, and these characterizations naturally lead to other search paradigsms, namely, maximal neighborhood search and LexDFS. Expand
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems. Expand
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Expand
Defining and identifying communities in networks.
TLDR
This article proposes a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability and applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods. Expand
Community detection in graphs
TLDR
A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists. Expand
Minimum sum of diameters clustering
The problem of determining a partition of a given set ofN entities intoM clusters such that the sum of the diameters of these clusters is minimum has been studied by Brucker (1978). He proved that itExpand
Axioms for graph clustering quality functions
TLDR
The investigation of properties that intuitively ought to be satisfied by graph clustering quality functions, that is, functions that assign a score to a clustering of a graph, indicates that the considered axiomatic framework covers existing 'good' quality functions forGraph clustering, and can be used to derive an interesting new family of quality functions. Expand
Statistical properties of community structure in large social and information networks
TLDR
It is found that a generative model, in which new edges are added via an iterative "forest fire" burning process, is able to produce graphs exhibiting a network community structure similar to that observed in nearly every network dataset examined. Expand
...
1
2
3
4
...