On a connection between small set expansions and modularity clustering

From MaRDI portal
Publication:2446591

DOI10.1016/J.IPL.2014.02.004zbMATH Open1284.68453arXiv1111.3048OpenAlexW2083674792MaRDI QIDQ2446591FDOQ2446591


Authors: Devendra Desai, Bhaskar Dasgupta Edit this on Wikidata


Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: In this paper we explore a connection between two seemingly different problems from two different domains: the small-set expansion problem studied in unique games conjecture, and a popular community finding approach for social networks known as the modularity clustering approach. We show that a sub-exponential time algorithm for the small-set expansion problem leads to a sub-exponential time constant factor approximation for some hard input instances of the modularity clustering problem.


Full work available at URL: https://arxiv.org/abs/1111.3048




Recommendations




Cites Work


Cited In (2)





This page was built for publication: On a connection between small set expansions and modularity clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446591)