2019
Modularity-based Sparse Soft Graph Clustering
AISTATS 2019poster
Clustering is a central problem in machine learning for which graph-based approaches have proven their efficiency. In this paper, we study a relaxation of the modularity maximization problem, well-known in the graph partitioning literature. A solution of this relaxation gives to each element of the…