Fetching the paper…
Reading the bibliography…
In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their cluster.
The estimation of the gradient of a density function, with application in pattern recognition
K. Fukunaga and L. D. Hostetler · 1975
Earlier work this paper cites.
Finding Groups in Data: An Introduction to Cluster Analysis
L. Kaufman and P. J. Rousseeuw · 1990
Earlier work this paper cites.
Kernel Smoothing
M. P. Wand and M. C. Jones · 1994
Earlier work this paper cites.
Mean shift, mode seeking, and clustering
Y. Cheng · 1995
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.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
Learning the parts of objects by non-negative matrix factorization
D. D. Lee and H. S. Seung · 1999
Earlier work this paper cites.
Mode-finding for mixtures of Gaussian distributions
M. Á. Carreira-Perpiñán · 2000
Earlier work this paper cites.
Normalized cuts and image segmentation
J. Shi and J. Malik · 2000
Earlier work this paper cites.
Mean shift: A robust approach toward feature space analysis
D. Comaniciu and P. Meer · 2002
Earlier work this paper cites.
EigenCuts: Half-lives of EigenFlows for spectral clustering
C. Chennubhotla and A. Jepson · 2003
Earlier work this paper cites.
Stochastic neighbor embedding
G. Hinton and S. T. Roweis · 2003
Cited alongside, same era.
Multiclass spectral clustering
S. X. Yu and J. Shi · 2003
Cited alongside, same era.
Semi-supervised learning using Gaussian fields and harmonic functions
X. Zhu, Z. Ghahramani, and J. Lafferty · 2003
Cited alongside, same era.
Proximity graphs for clustering and manifold learning
M. Á. Carreira-Perpiñán and R. S. Zemel · 2005
Cited alongside, same era.
Self-tuning spectral clustering
L. Zelnik-Manor and P. Perona · 2005
Cited alongside, same era.
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
M. Belkin, P. Niyogi, and V. Sindhwani · 2006
Cited alongside, same era.
Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008
Later among the works it cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Later among the works it cites.
The Elements of Statistical Learning—Data Mining, Inference and Prediction
T. J. Hastie, R. J. Tibshirani, and J. H. Friedman · 2009
Later among the works it cites.
Large graph construction for scalable semi-supervised learning
W. Liu, J. He, and S.-F. Chang · 2010
Later among the works it cites.
Agglomerative mean-shift clustering
X. Yuan, B.-G. Hu, and R. He · 2010
Later among the works it cites.
Clustering by left-stochastic matrix factorization
R. Arora, M. Gupta, A. Kapila, and M. Fazel · 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…
Pattern Recognition and Machine Learning
C. M. Bishop · 2006
Cited alongside, same era.
Acceleration strategies for Gaussian mean-shift image segmentation
M. Á. Carreira-Perpiñán · 2006
Cited alongside, same era.
k-means++
D. Arthur and S. Vassilvitskii · 2007
Cited alongside, same era.
Gaussian mean shift is an EM algorithm
M. Á. Carreira-Perpiñán · 2007
Cited alongside, same era.
A tutorial on spectral clustering
U. von Luxburg · 2007
Cited alongside, same era.
Graph regularized nonnegative matrix factorization for data representation
D. Cai, X. He, J. Han, and T. S. Huang · 2011
Later among the works it cites.
Clustering by low-rank doubly stochastic matrix decomposition
Z. Yang and E. Oja · 2012
Later among the works it cites.
The K K -modes algorithm for clustering
M. Á. Carreira-Perpiñán and W. Wang · 2013
Later among the works it cites.
Entropic affinities: Properties and efficient numerical computation
M. Vladymyrov and M. Á. Carreira-Perpiñán · 2013
Later among the works it cites.
W. Wang and M. Á. Carreira-Perpiñán · 2013
Later among the works it cites.