25 citations · 27 across the 2 of their papers we have counts for
3 papers
math.ST2016
Estimating perimeter using graph cuts
Nicolás García Trillos, Dejan Slepčev, James von Brecht
We investigate the estimation of the perimeter of a set by a graph cut of a random geometric graph. For , with , we are given random i.i.d. poin…
stat.ML2014★ 25 cited
Consistency of Cheeger and Ratio Graph Cuts
Nicolas Garcia Trillos, Dejan Slepcev, James von Brecht +2
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measu…
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…