Ensemble-based algorithms to detect disjoint and overlapping communities in networks

Tanmoy Chakraborty, Noseong Park, V. S. Subrahmanian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Given a set AL of community detection algorithms and a graph G as inputs, we propose two ensemble methods EnDisCo and MeDOC that (respectively) identify disjoint and overlapping communities in G. EnDisCo transforms a graph into a latent feature space by leveraging multiple base solutions and discovers disjoint community structure. MeDOC groups similar base communities into a meta-community and detects both disjoint and overlapping community structures. Experiments are conducted at different scales on both synthetically generated networks as well as on several real-world networks for which the underlying ground-truth community structure is available. Our extensive experiments show that both algorithms outperform state-of-the-art non-ensemble algorithms by a significant margin. Moreover, we compare EnDisCo and MeDOC with a recent ensemble method for disjoint community detection and show that our approaches achieve superior performance. To the best of our knowledge, MeDOC is the first ensemble approach for overlapping community detection.

Original languageEnglish
Title of host publicationProceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
EditorsRavi Kumar, James Caverlee, Hanghang Tong
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages73-80
Number of pages8
ISBN (Electronic)9781509028467
DOIs
Publication statusPublished - 2016 Nov 21
Event2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 - San Francisco, United States
Duration: 2016 Aug 182016 Aug 21

Publication series

NameProceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016

Other

Other2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016
CountryUnited States
CitySan Francisco
Period16/8/1816/8/21

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Sociology and Political Science
  • Communication

Fingerprint Dive into the research topics of 'Ensemble-based algorithms to detect disjoint and overlapping communities in networks'. Together they form a unique fingerprint.

  • Cite this

    Chakraborty, T., Park, N., & Subrahmanian, V. S. (2016). Ensemble-based algorithms to detect disjoint and overlapping communities in networks. In R. Kumar, J. Caverlee, & H. Tong (Eds.), Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016 (pp. 73-80). [7752216] (Proceedings of the 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASONAM.2016.7752216