Convergence of a Steepest Descent Algorithm for Ratio Cut Clustering

Xavier Bresson, Thomas Laurent, David Uminsky +1

Unsupervised clustering of scattered, noisy and high-dimensional data points is an important and difficult problem. Tight continuous relaxations of balanced cut problems have recen…