A mixed-integer linear programming approach for soft graph clustering
Discrete Mathematics
2019-06-13 v1
Abstract
This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that enforces an equal balance of the cluster memberships. Compared to ([Palla et al., 2005], [Derenyi et al., 2005], [Adamcsek et al., 2006]), the clusters found in our method are not limited to k-clique neighbourhoods. Compared to ([Hope and Keller, 2013]), our method can produce non-trivial clusters even for a connected unweighted graph.
Cite
@article{arxiv.1906.04860,
title = {A mixed-integer linear programming approach for soft graph clustering},
author = {Vicky Mak-Hau and John Yearwood},
journal= {arXiv preprint arXiv:1906.04860},
year = {2019}
}