Node-centric detection of overlapping communities in social networks

Yehonatan Cohen, Danny Hendler, Amir Rubin

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageAmerican English
Title of host publicationSpringer Proceedings in Complexity
PublisherSpringer
Pages1-10
Number of pages10
DOIs
StatePublished - 1 Jan 2017

Publication series

NameSpringer Proceedings in Complexity

Keywords

  • Community detection
  • Extended modularity
  • Louvain method
  • Overlapping communities
  • Weighted community clustering

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Modelling and Simulation
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Node-centric detection of overlapping communities in social networks'. Together they form a unique fingerprint.

Cite this