On the evaluation potential of quality functions in community detection for different contexts
arXiv:1510.01714 · doi:10.1007/978-3-319-28361-6_9
Abstract
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 methodology to identify different contexts, i.e. groups of graphs where the quality functions behave similarly. In these contexts we identify the best quality functions, i.e. quality functions whose results are consistent with expectations from real life applications.
14 pages, 11 tables, Advances in Network Science: 12th International Conference and School, NetSci-X 2016, Wroclaw, Poland, January 11-13, 2016
References in corpus (9)
- Fast unfolding of communities in large networks
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Benchmark graphs for testing community detection algorithms
- Resolution limit in community detection
- Detecting the overlapping and hierarchical community structure of complex networks
- Detecting communities using asymptotical Surprise
- Surprise maximization reveals the community structure of complex networks
- On the Permanence of Vertices in Network Communities