On the Evaluation Potential of Quality Functions in Community Detection for Different Contexts

@inproceedings{Creusefond2016OnTE,
  title={On the Evaluation Potential of Quality Functions in Community Detection for Different Contexts},
  author={Jean Creusefond and Thomas Largillier and Sylvain Peyronnet},
  booktitle={NetSci-X},
  year={2016}
}
Due to nowadays networks' sizes, the evaluation of a community detection algorithm can only be done using quality functions. These functions measure different networks/graphs structural properties, each of them corresponding to a different definition of a community. Since there exists many definitions for a community, choosing a quality function may be a difficult task, even if the networks' statistics/origins can give some clues about which one to choose. In this paper, we apply a general… 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
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
Community detection algorithm evaluation with ground-truth data
TLDR
This work proposes to exploit the topological features of the ‘community graphs’ (where the nodes are the communities and the links represent their interactions) in order to evaluate the algorithms of overlapping community detection algorithms using a set of real-world networks with known a priori community structure. Expand
Community Structures Evaluation in Complex Networks: A Descriptive Approach
TLDR
This work proposes a methodology that allows one to expose structural information of clusters in a network partition in a comprehensive way, thus eventually helps one to compare communities identified by different community detection methods and helps to clarify the composition of communities in real-world networks. Expand
Defining quality metrics for graph clustering evaluation
TLDR
A set of three quality metrics for graph clustering that have the ability to ensure accuracy along with the quality are proposed that will definitely improve the decision-making in expert and intelligent systems. Expand
Tracking community evolution in social networks: A survey
TLDR
A classification of various methods for tracking community evolution in dynamic social networks into four main approaches using as a criterion the functioning principle is proposed, based on independent successive static detection and matching. Expand
A local search method for graph clustering heuristics based on partitional Distribution learning
TLDR
A novel local search method is elaborates on that allows boosting the convergence of nature-inspired heuristic solvers by estimating and sampling the cluster arrangement distribution from the set of intermediate produced solutions of the algorithm at hand. Expand
Evolution of communities in dynamic social networks: An efficient map-based approach
TLDR
This article evaluates the proposed approach with seventeen publicly available social network datasets and compared its performance against other well-known methods in the literature, and introduced ICEM, a novel method for Identification of Community Evolution by Mapping. 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
Node-centric Community Discovery: From static to dynamic social network analysis
TLDR
A comprehensive and concise review of the main results, both algorithmic and analytical, obtained in this field and to better underline the rationale behind the research activity on Community Discovery is provided. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
Benchmark graphs for testing community detection algorithms.
TLDR
This work introduces a class of benchmark graphs, that account for the heterogeneity in the distributions of node degrees and of community sizes, and uses this benchmark to test two popular methods of community detection, modularity optimization, and Potts model clustering. Expand
Significant Scales in Community Structure
TLDR
An efficient method for scanning for resolutions in multi-resolution methods and the notion of “significance” of a partition, based on subgraph probabilities is introduced, which can determine “good” resolution parameters, which is demonstrated on benchmark networks. Expand
Is There a Best Quality Metric for Graph Clusters?
TLDR
The results show that currently used clustering algorithms and quality metrics do not behave as expected when cluster structures are different from the more traditional, clique-like ones, especially seen in larger networks. Expand
Resolution limit in community detection
TLDR
It is found that modularity optimization may fail to identify modules smaller than a scale which depends on the total size of the network and on the degree of interconnectedness of the modules, even in cases where modules are unambiguously defined. 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
A comparison of extrinsic clustering evaluation metrics based on formal constraints
TLDR
This article defines a few intuitive formal constraints on such metrics which shed light on which aspects of the quality of a clustering are captured by different metric families, and proposes a modified version of Bcubed that avoids the problems found with other metrics. Expand
Fast unfolding of communities in large networks
TLDR
This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity. Expand
Defining and Evaluating Network Communities Based on Ground-Truth
TLDR
This paper studies a set of 230 large real-world social, collaboration and information networks where nodes explicitly state their group memberships and proposes a methodology which allows for compare and quantitatively evaluate how different structural definitions of network communities correspond to ground-truth communities. Expand
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability. Expand
Surprise maximization reveals the community structure of complex networks
TLDR
It is concluded that Surprise maximization precisely reveals the community structure of complex networks. Expand
...
1
2
3
4
...