Fetching the paper…
Reading the bibliography…
The $k$-means clustering algorithm is popular but has the following main drawbacks: 1) the number of clusters, $k$, needs to be provided by the user in advance, 2) it can easily reach local minima with randomly selected initial centers, 3) it is sensitive to outliers, and 4) it can only deal with well separated hyperspherical clusters.
W. Rudin, Principles of mathematical analysis . New York: McGraw-Hill Science, 1964, vol. 3
1964
Earlier work this paper cites.
S. Z. Selim and M. A. Ismail, “K-means-type algorithms: a generalized convergence theorem and characterization of local optimality,” IEEE Trans. Pattern Anal. Math. Intell. , no. 1, pp. 81–87, 1984
1984
Earlier work this paper cites.
J. A. Hartigan and P. Hartigan, “The dip test of unimodality,” The Ann. of Stat. , pp. 70–84, 1985
1985
Earlier work this paper cites.
F. Samaria and A. Harter, “Parameterisation of a stochastic model for human face identification,” in Proc. 2rd WACV , 1994, pp. 138–142
1994
Earlier work this paper cites.
L. Bottou, Y. Bengio et al. , “Convergence properties of the k-means algorithms,” Proc. NIPS , pp. 585–592, 1995
1995
Earlier work this paper cites.
R. E. Kass and L. Wasserman, “A reference bayesian test for nested hypotheses and its relationship to the schwarz criterion,” J. of the Amer. Stat. Associat. , vol. 90, no. 431, pp. 928–934, 1995
1995
Earlier work this paper cites.
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based algorithm for discovering clusters in large spatial databases with noise,” in KDD , vol. 96, no. 34, 1996, pp. 226–231
1996
Earlier work this paper cites.
T. K. Moon, “The expectation-maximization algorithm,” IEEE Signal Process. Mag. , vol. 13, no. 6, pp. 47–60, 1996
1996
Earlier work this paper cites.
F. Alimoglu and E. Alpaydin, “Methods of combining multiple classifiers based on different representations for pen-based handwritten digit recognition,” in Proc. of the 5th TAINN . Citeseer, 1996
1996
Earlier work this paper cites.
S. A. Nene, S. K. Nayar, H. Murase et al. , “Columbia object image library (coil-20),” CUCS-005-96, Tech. Rep., Feb. 1996
1996
Earlier work this paper cites.
S. Nayar, S. A. Nene, and H. Murase, “Columbia object image library (coil-100),” Department of Comp. Science, Columbia University, Tech. Rep. CUCS-006-96 , 1996
1996
Earlier work this paper cites.
A. K. Jain, M. N. Murty, and P. J. Flynn, “Data clustering: a review,” ACM comput. surveys , vol. 31, no. 3, pp. 264–323, 1999
1999
Earlier work this paper cites.
S. Santini and R. Jain, “Similarity measures,” IEEE Trans. Pattern Anal. Math. Intell. , vol. 21, no. 9, pp. 871–883, 1999
1999
Earlier work this paper cites.
D. Pelleg, A. W. Moore et al. , “X-means: Extending k-means with efficient estimation of the number of clusters.” in Proc. ICML , 2000, pp. 727–734
2000
Earlier work this paper cites.
H. S. Seung and D. D. Lee, “The manifold ways of perception,” Sci. , vol. 290, no. 5500, pp. 2268–2269, 2000
2000
Earlier work this paper cites.
I. Kärkkäinen and P. Fränti, “Dynamic local search algorithm for the clustering problem,” in Research Report A . University of Joensuu, 2002
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
J.-S. Zhang and Y.-W. Leung, “Robust clustering by pruning outliers,” IEEE Trans. Syst., Man, Cybern. B , vol. 33, no. 6, pp. 983–998, 2003
2003
Cited alongside, same era.
C.-W. Hsu, C.-C. Chang, C.-J. Lin et al. , “A practical guide to support vector classification,” 2003
2003
Cited alongside, same era.
G. Hamerly and C. Elkan, “Learning the k in k-means,” in Proc. NIPS , 2004, pp. 281–288
2004
Cited alongside, same era.
V. J. Hodge and J. Austin, “A survey of outlier detection methodologies,” Art. Intell. Review , vol. 22, no. 2, pp. 85–126, 2004
2004
Cited alongside, same era.
S. J. Sheather et al. , “Density estimation,” Stat. Sci. , vol. 19, no. 4, pp. 588–597, 2004
2004
Cited alongside, same era.
L. Kaufman and P. J. Rousseeuw, Finding groups in data: an introduction to cluster analysis . John Wiley & Sons, 2009, vol. 344
2009
Later among the works it cites.
M. P. Sampat, Z. Wang, S. Gupta, A. C. Bovik, and M. K. Markey, “Complex wavelet structural similarity: A new image similarity index,” IEEE Trans. Image Process. , vol. 18, no. 11, pp. 2385–2401, 2009
2009
Later among the works it cites.
A. K. Jain, “Data clustering: 50 years beyond k-means,” Pattern Recogn. Letters , vol. 31, no. 8, pp. 651–666, 2010
2010
Later among the works it cites.
A. Coates and A. Y. Ng, “The importance of encoding versus training with sparse coding and vector quantization,” in Proc. 28th ICML , 2011, pp. 921–928
2011
Later among the works it cites.
G. Canas, T. Poggio, and L. Rosasco, “Learning manifolds with k-means and k-flats,” in Proc. NIPS , 2012, pp. 2465–2473
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, “Local search heuristics for k-median and facility location problems,” SIAM J. on Comput. , vol. 33, no. 3, pp. 544–562, 2004
2004
Cited alongside, same era.
R. Xu, D. Wunsch et al. , “Survey of clustering algorithms,” IEEE Trans. Neural Netw. , vol. 16, no. 3, pp. 645–678, 2005
2005
Cited alongside, same era.
V. Hautamäki, S. Cherednichenko, I. Kärkkäinen, T. Kinnunen, and P. Fränti, “Improving k-means by outlier removal,” in Image Anal. Springer, 2005, pp. 978–987
2005
Cited alongside, same era.
P. Berkhin, “A survey of clustering data mining techniques,” in Group. Multidimens. Data . Springer, 2006, pp. 25–71
2006
Cited alongside, same era.
P. Fränti and O. Virmajoki, “Iterative shrinking method for clustering problems,” Pattern Recogn. , vol. 39, no. 5, pp. 761–775, 2006
2006
Cited alongside, same era.
D. Arthur and S. Vassilvitskii, “k-means++: The advantages of careful seeding,” in Proc. 8th ann. ACM-SIAM symposium on Discrete alg. Society for Industrial and Applied Mathematics, 2007, pp. 1027–1035
2007
Cited alongside, same era.
T. Su and J. G. Dy, “In search of deterministic methods for initializing k-means and gaussian mixture clustering,” Intelligent Data Analysis , vol. 11, no. 4, pp. 319–338, 2007
2007
Cited alongside, same era.
Later among the works it cites.
F. Murtagh and P. Contreras, “Algorithms for hierarchical clustering: an overview,” Data Min. and Knowl. Discov. , vol. 2, no. 1, pp. 86–97, 2012
2012
Later among the works it cites.
Q. Liu, Z. Zhao, Y.-X. Li, and Y. Li, “Feature selection based on sensitivity analysis of fuzzy isodata,” Neurocomput. , vol. 85, pp. 29–37, 2012
2012
Later among the works it cites.
A. Kalogeratos and A. Likas, “Dip-means: an incremental clustering method for estimating the number of clusters,” in Proc. NIPS , 2012, pp. 2393–2401
2012
Later among the works it cites.
M. E. Celebi, H. A. Kingravi, and P. A. Vela, “A comparative study of efficient initialization methods for the k-means clustering algorithm,” Expert Systems with Applications , vol. 40, no. 1, pp. 200–210, 2013
2013
Later among the works it cites.
S. Anand, S. Mittal, O. Tuzel, and P. Meer, “Semi-supervised kernel mean shift clustering,” IEEE Trans. Pattern Anal. Math. Intell. , vol. 36, no. 6, pp. 1201–1215, 2014
2014
Later among the works it cites.
A. Rodriguez and A. Laio, “Clustering by fast search and find of density peaks,” Sci. , vol. 344, no. 6191, pp. 1492–1496, 2014
2014
Later among the works it cites.
G. Tzortzis and A. Likas, “The minmax k-means clustering algorithm,” Pattern Recogn. , vol. 47, no. 7, pp. 2505–2516, 2014
2014
Later among the works it cites.
E. Tu, L. Cao, J. Yang, and N. Kasabov, “A novel graph-based k-means for nonlinear manifold clustering and representative selection,” Neurocomput. , vol. 143, pp. 109–122, 2014
2014
Later among the works it cites.
C. Boutsidis, A. Zouzias, M. W. Mahoney, and P. Drineas, “Randomized dimensionality reduction for k-means clustering,” IEEE Trans. Inf. Theory , vol. 61, no. 2, pp. 1045–1062, 2015
2015
Later among the works it cites.
M. E. Celebi and H. A. Kingravi, “Linear, deterministic, and order-invariant initialization methods for the k-means clustering algorithm,” in Partitional Clustering Algorithms . Springer, 2015, pp. 79–98
2015
Later among the works it cites.
F. Li, X. Huang, H. Qiao, and B. Zhang, “A new manifold distance for visual object categorization,” in Proc. 12th World Congress on Intelligent Control and Automation , 2016, pp. 2232–2236
2016
Closest in time.