Abstract
We present NECTAR, a community detection algorithm that generalizes Louvain method's local search heuristic for overlapping community structures. NECTAR chooses dynamically which objective function to optimize based on the network on which it is invoked. Our experimental evaluation on both synthetic benchmark graphs and real-world networks, based on ground-truth communities, shows that NECTAR provides excellent results as compared with state of the art community detection algorithms.
Original language | American English |
---|---|
Title of host publication | Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 |
Editors | Ravi Kumar, James Caverlee, Hanghang Tong |
Pages | 1384-1385 |
Number of pages | 2 |
ISBN (Electronic) | 9781509028467 |
DOIs | |
State | Published - 21 Nov 2016 |
Event | 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 - San Francisco, United States Duration: 18 Aug 2016 → 21 Aug 2016 |
Conference
Conference | 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 18/08/16 → 21/08/16 |
Keywords
- Community detection
- Louvain method
- modularity
- objective function
- overlapping communities
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Sociology and Political Science
- Communication