# Node-Centric Detection of Overlapping Communities in Social Networks

arXiv: https://arxiv.org/abs/1607.01683 · HTML: https://mlsanity.com/paper/1607.01683/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 6 Jul 2016.

## Built on by (most cited first, 2 of 2)

- [Machine-Learning Based Objective Function Selection for Community Detection](https://mlsanity.com/paper/2203.13495/) (2022)
- [Graph-Based Floor Separation Using Node Embeddings and Clustering of WiFi Trajectories](https://mlsanity.com/paper/2505.08088/) (2025)

## Abstract (arXiv)

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.