Fetching the paper…
Reading the bibliography…
We consider the problem of clustering with the longest-leg path distance (LLPD) metric, which is informative for elongated and irregularly shaped clusters.
Inequalities for certain eigenvalues of a membrane of given area
G. Szegö · 1954
Earlier work this paper cites.
An isoperimetric inequality for the n-dimensional free membrane problem
H.F. Weinberger · 1956
Earlier work this paper cites.
Algorithms for the assignment and transportation problems
J. Munkres · 1957
Earlier work this paper cites.
Sur la division des corps matériels en parties
H. Steinhaus · 1957
Earlier work this paper cites.
Curvature measures
H. Federer · 1959
Earlier work this paper cites.
Letter to the editor: The maximum capacity through a network
M. Pollack · 1960
Earlier work this paper cites.
Random plane networks
E.N. Gilbert · 1961
Earlier work this paper cites.
Letter to the editor: The maximum capacity route problem
T.C. Hu · 1961
Earlier work this paper cites.
On the mean accuracy of statistical pattern recognizers
G. Hughes · 1968
Earlier work this paper cites.
A three-dimensional cluster problem
F.D. Roberts and S.H. Storey · 1968
Earlier work this paper cites.
SLINK: an optimally efficient algorithm for the single-link cluster method
R. Sibson · 1973
Earlier work this paper cites.
Multidimensional binary search trees used for associative searching
J.L. Bentley · 1975
Earlier work this paper cites.
The min-max spanning tree problem and some extensions
P.M. Camerini · 1978
Earlier work this paper cites.
Consistency of single linkage for high-density clusters
J.A. Hartigan · 1981
Earlier work this paper cites.
Optimal preprocessing for answering on-line product queries
N. Alon and B. Schieber · 1987
Earlier work this paper cites.
Algorithms for two bottleneck optimization problems
H. Gabow and R.E. Tarjan · 1988
Earlier work this paper cites.
Mixture models: Inference and applications to clustering , volume 84
G.J. McLachlan and K.E. Basford · 1988
Earlier work this paper cites.
A guided tour of Chernoff bounds
T. Hagerup and C. Rüb · 1990
Earlier work this paper cites.
Matrix perturbation theory
G.W Stewart · 1990
Earlier work this paper cites.
A linear time algorithm for the maximum capacity path problem
A.P. Punnen · 1991
Earlier work this paper cites.
Introduction to Percolation Theory
D. Stauffer and A. Aharony · 1994
Earlier work this paper cites.
Methods of combining multiple classifiers based on different representations for pen-based handwritten digit recognition
F. Alimoglu and E. Alpaydin · 1996
Earlier work this paper cites.
A density-based algorithm for discovering clusters in large spatial databases with noise
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu · 1996
Earlier work this paper cites.
Columbia object image library (coil-20)
S.A. Nene, S.K. Nayar, and H. Murase · 1996
Earlier work this paper cites.
Spectral graph theory , volume 92
F. Chung · 1997
Earlier work this paper cites.
The longest edge of the random minimal spanning tree
M. Penrose · 1997
Earlier work this paper cites.
Numerical linear algebra , volume 50
L.N. Trefethen and D. Bau · 1997
Earlier work this paper cites.
A distribution-based clustering algorithm for mining in large spatial databases
X. Xu, M. Ester, H.-P. Kriegel, and J. Sander · 1998
Earlier work this paper cites.
Beyond kappa: A review of interrater agreement measures
M. Banerjee, M. Capozzoli, L. McSweeney, and D. Sinha · 1999
Earlier work this paper cites.
A strong law for the longest edge of the minimal spanning tree
R. Penrose · 1999
Cited alongside, same era.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Cited alongside, same era.
Path based pairwise data clustering with application to texture segmentation
B. Fischer, T. Zöller, and J. Buhmann · 2001
Cited alongside, same era.
The Elements of Statistical Learning , volume 1
J. Friedman, T. Hastie, and R. Tibshirani · 2001
Cited alongside, same era.
Learning segmentation by random walks
M. Meila and J. Shi · 2001
Cited alongside, same era.
The connectivity of a graph on uniform points on [ 0 , 1 ] d [0,1]^{d}
M. Appel and R. Russo · 2002
Cited alongside, same era.
Clustering based on pairwise distances when the data is of mixed dimensions
E. Arias-Castro · 2011
Later among the works it cites.
Spectral clustering based on local linear approximations
E. Arias-Castro, G. Chen, and G. Lerman · 2011
Later among the works it cites.
Noise thresholds for spectral clustering
S. Balakrishnan, M. Xu, A. Krishnamurthy, and A. Singh · 2011
Later among the works it cites.
Geometry of manifolds , volume 15
R.L. Bishop and R.J. Crittenden · 2011
Later among the works it cites.
Subspace clustering
R. Vidal · 2011
Later among the works it cites.
A geometric analysis of subspace clustering with outliers
M. Soltanolkotabi and E.J. Candes · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On spectral clustering: Analysis and an algorithm
A.Y. Ng, M.I. Jordan, and Y. Weiss · 2002
Cited alongside, same era.
Path-based clustering for grouping of smooth curves and texture segmentation
B. Fischer and J.M. Buhmann · 2003
Cited alongside, same era.
A clustering procedure based on the comparison between the k nearest neighbors graph and the minimal spanning tree
J.M. González-Barrios and A.J. Quiroz · 2003
Cited alongside, same era.
Clustering with the connectivity kernel
B. Fischer, V. Roth, and J.M. Buhmann · 2004
Cited alongside, same era.
Subspace clustering for high dimensional data: a review
L. Parsons, E. Haque, and H. Liu · 2004
Cited alongside, same era.
Self-tuning spectral clustering
L. Zelnik-Manor and P. Perona · 2004
Cited alongside, same era.
B. Sriperumbudur and I. Steinwart · 2012
Later among the works it cites.
Hybrid linear modeling via local best-fit flats
T. Zhang, A. Szlam, Y. Wang, and G. Lerman · 2012
Later among the works it cites.
Cluster trees on manifolds
S. Balakrishnan, S. Narayanan, A. Rinaldo, A. Singh, and L. Wasserman · 2013
Later among the works it cites.
Sparse subspace clustering: Algorithm, theory, and applications
E. Elhamifar and R. Vidal · 2013
Later among the works it cites.
UCI machine learning repository, 2013
M. Lichman · 2013
Later among the works it cites.
On cartesian trees and range minimum queries
E.D. Demaine, G.M. Landau, and O. Weimann · 2014
Later among the works it cites.
Clustering by fast search and find of density peaks
A. Rodriguez and A. Laio · 2014
Later among the works it cites.
Robust subspace clustering
M. Soltanolkotabi, E. Elhamifar, and E.J. Candes · 2014
Later among the works it cites.
Riemannian multi-manifold modeling
X. Wang, K. Slavakis, and G. Lerman · 2014
Later among the works it cites.
Adaptive control processes: a guided tour
R.E. Bellman · 2015
Later among the works it cites.
The geometry of kernelized spectral clustering
G. Schiebinger, M.J. Wainwright, and B. Yu · 2015
Later among the works it cites.
Consistency of Cheeger and ratio graph cuts
N. Garcia Trillos, D. Slepcev, J. Von Brecht T. Laurent, and X. Bresson · 2016
Later among the works it cites.
Spectral clustering based on local PCA
E. Arias-Castro, G. Lerman, and T. Zhang · 2017
Closest in time.
Clustering subgaussian mixtures by semidefinite programming
D.G. Mixon, S. Villar, and R. Ward · 2017
Closest in time.
Community detection and stochastic block models: Recent developments
E. Abbe · 2018
Closest in time.
An ℓ ∞ \ell^{\infty} eigenvector perturbation bound and its application to robust covariance estimation
J. Fan, W. Wang, and Y. Zhong · 2018
Closest in time.
N. Garcia Trillos, M. Gerlach, M. Hein, and D. Slepcev · 2018
Closest in time.
Learning by unsupervised nonlinear diffusion
M. Maggioni and J.M. Murphy · 2018
Closest in time.
Diffusion geometric methods for fusion of remotely sensed data
J.M. Murphy and M. Maggioni · 2018
Closest in time.
A simple SVD algorithm for finding hidden partitions
V. Vu · 2018
Closest in time.
Geometric structure of graph Laplacian embeddings
N. Garcia Trillos, F. Hoffmann, and B. Hosseini · 2019
Closest in time.
Unsupervised clustering and active learning of hyperspectral images with nonlinear diffusion
J.M. Murphy and M. Maggioni · 2019
Closest in time.