1.7k citations · 3.6k across the 34 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2013★ 15 cited
An Adaptive Total Variation Algorithm for Computing the Balanced Cut of a Graph
Xavier Bresson, Thomas Laurent, David Uminsky +1
We propose an adaptive version of the total variation algorithm proposed in [3] for computing the balanced cut of a graph. The algorithm from [3] used a sequence of inner total var…
math.OC2012★ 2 cited
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…