Fetching the paper…
Reading the bibliography…
This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds.
On the Volume of Tubes
H. Weyl · 1939
Earlier work this paper cites.
A Lower Bound for the Smallest Eigenvalue of the Laplacian
J. Cheeger · 1970
Earlier work this paper cites.
Consistency of single linkage for high density clusters
J. Hartigan · 1981
Earlier work this paper cites.
Strong consistency of k-means clustering. ann. statist. 9 135–140
D. Pollard · 1981
Earlier work this paper cites.
Real analysis and probability
R. M. Dudley · 1989
Earlier work this paper cites.
Towards efficient hierarchical designs by ratio cut partitioning
Y.-C. Wei and C.-K. Cheng · 1989
Earlier work this paper cites.
New spectral methods for ratio cut partitioning and clustering
L. Hagen and A. Kahng · 1992
Earlier work this paper cites.
An Introduction to Γ \Gamma -convergence
G. Dal Maso · 1993
Earlier work this paper cites.
Spectral Graph Theory
F. R. K. Chung · 1997
Earlier work this paper cites.
BV functions with respect to a measure and relaxation of metric integral functionals
G. Bellettini, G. Bouchitté, and I. Fragalà · 1999
Earlier work this paper cites.
Critical power for asymptotic connectivity in wireless networks
P. Gupta and P. R. Kumar · 1999
Earlier work this paper cites.
A strong law for the longest edge of the minimal spanning tree
M. Penrose · 1999
Earlier work this paper cites.
Functions of bounded variation and free discontinuity problems
L. Ambrosio, N. Fusco, and D. Pallara · 2000
Earlier work this paper cites.
Normalized Cuts and Image Segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
Weighted BV functions
A. Baldi · 2001
Earlier work this paper cites.
Gamma-Convergence for Beginners
A. Braides · 2002
Cited alongside, same era.
Random geometric graphs
M. Penrose · 2003
Cited alongside, same era.
Multiclass spectral clustering
S. X. Yu and J. Shi · 2003
Cited alongside, same era.
Sharp thresholds for monotone properties in random geometric graphs
A. Goel, S. Rai, and B. Krishnamachari · 2004
Cited alongside, same era.
On clusterings: Good, bad and spectral
R. Kannan, S. Vempala, and A. Vetta · 2004
Cited alongside, same era.
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
D. A. Spielman and S.Teng · 2004
Cited alongside, same era.
Consistency of spectral clustering
Expander flows, geometric embeddings and graph partitioning
S. Arora, S. Rao, and U. Vazirani · 2009
Later among the works it cites.
A first course in Sobolev spaces
G. Leoni · 2009
Later among the works it cites.
An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA
M. Hein and T. Bühler · 2010
Later among the works it cites.
Total variation and Cheeger cuts
A. Szlam and X. Bresson · 2010
Later among the works it cites.
An analysis of the convergence of graph Laplacians
D. Ting, L. Huang, and M. I. Jordan · 2010
Later among the works it cites.
Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts
M. Hein and S. Setzer · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
U. von Luxburg, M. Belkin, and O. Bousquet · 2004
Cited alongside, same era.
From graphs to manifolds–weak and strong pointwise consistency of graph Laplacians
M. Hein, J.-Y. Audibert, and U. Von Luxburg · 2005
Cited alongside, same era.
Local graph partitioning using pagerank vectors
R. Andersen, F. Chung, and K. Lang · 2006
Cited alongside, same era.
Convergence of Laplacian eigenmaps
M. Belkin and P. Niyogi · 2006
Cited alongside, same era.
Empirical graph Laplacian approximation of Laplace-Beltrami operators: large sample results
E. Giné and V. Koltchinskii · 2006
Cited alongside, same era.
From graph to manifold Laplacian: the convergence rate
A. Singer · 2006
Cited alongside, same era.
The normalized graph cut and Cheeger constant: from discrete to continuous
E. Arias-Castro, B. Pelletier, and P. Pudlo · 2012
Later among the works it cites.
Asymmetric Cheeger cut and application to multi-class unsupervised clustering
X. Bresson and T. Laurent · 2012
Later among the works it cites.
Convergence and energy landscape for Cheeger cut clustering
X. Bresson, T. Laurent, D. Uminsky, and J. von Brecht · 2012
Later among the works it cites.
On the convergence of maximum variance unfolding
E. Arias-Castro and B. Pelletier · 2013
Later among the works it cites.
Multiclass total variation clustering
X. Bresson, T. Laurent, D. Uminsky, and J. von Brecht · 2013
Later among the works it cites.
How the result of graph clustering methods depends on the construction of the graph
M. Maier, U. von Luxburg, and M. Hein · 2013
Later among the works it cites.
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
D. A. Spielman and S. Teng · 2013
Later among the works it cites.
Continuum limit of total variation on point clouds
N. García Trillos and D. Slepčev · 2014
Closest in time.
On the rate of convergence of empirical measures in ∞ \infty -transportation distance
N. García Trillos and D. Slepčev · 2014
Closest in time.