Benchmarking community detection methods on social media data
arXiv:1302.0739
Abstract
Benchmarking the performance of community detection methods on empirical social network data has been identified as critical for improving these methods. In particular, while most current research focuses on detecting communities in data that has been digitally extracted from large social media and telecommunications services, most evaluation of this research is based on small, hand-curated datasets. We argue that these two types of networks differ so significantly that by evaluating algorithms solely on the former, we know little about how well they perform on the latter. To address this problem, we consider the difficulties that arise in constructing benchmarks based on digitally extracted network data, and propose a task-based strategy which we feel addresses these difficulties. To demonstrate that our scheme is effective, we use it to carry out a substantial benchmark based on Facebook data. The benchmark reveals that some of the most popular algorithms fail to detect fine-grained community structure.
References in corpus (11)
- Scikit-learn: Machine Learning in Python
- Community structure in social and biological networks
- Modularity and community structure in networks
- Cooperative Game Theory Approaches for Network Partitioning
- Social Structure of Facebook Networks
- Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems
- Detecting highly overlapping community structure by greedy clique expansion
- Characterizing the community structure of complex networks
- Normalized Mutual Information to evaluate overlapping community finding algorithms
- Markov dynamics as a zooming lens for multiscale community detection: non clique-like communities and the field-of-view limit
- Structure and Overlaps of Communities in Networks