Ensemble-Based Algorithms to Detect Disjoint and Overlapping Communities in Networks

Tanmoy Chakraborty, Noseong Park, V. S. Subrahmanian

Given a set $\mathcal{A}\mathcal{L}$ of community detection algorithms and a graph $G$ as inputs, we propose two ensemble methods $\mathtt{EnDisCO}$ and $\mathtt{MeDOC}$ that (respectively) ide…