Clustering for Different Scales of Measurement - the Gap-Ratio Weighted K-means Algorithm

R. A. Fisher, “The use of multiple measurements in taxonomic problems,” Annals of eugenics , vol. 7, no. 2, pp. 179–188, 1936

1936

Earlier work this paper cites.

S. S. Stevens, “On the theory of scales of measurement,” 1946

1946

Earlier work this paper cites.

A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the em algorithm,” Journal of the royal statistical society. Series B (methodological) , pp. 1–38, 1977

1977

Earlier work this paper cites.

S. Lloyd, “Least squares quantization in pcm,” IEEE transactions on information theory , vol. 28, no. 2, pp. 129–137, 1982

1982

Earlier work this paper cites.

E. Oja and A. Hyvarinen, “A fast fixed-point algorithm for independent component analysis,” Neural computation , vol. 9, no. 7, pp. 1483–1492, 1997

1997

Earlier work this paper cites.

R. O. Duda, P. E. Hart, and D. G. Stork, “Unsupervised learning and clustering,” Pattern classification , pp. 519–598, 2001

2001

Earlier work this paper cites.

J. C. Bezdek and R. J. Hathaway, Some Notes on Alternating Optimization . Berlin, Heidelberg: Springer Berlin Heidelberg, 2002, pp. 288–300. [Online]. Available: http://dx.doi.org/10.1007/3-540-45631-7_39

2002

Earlier work this paper cites.

R. Xu and D. Wunsch, “Survey of clustering algorithms,” IEEE Transactions on neural networks , vol. 16, no. 3, pp. 645–678, 2005

2005

Cited alongside, same era.

S. Theodoridis and K. Koutroumbas, “Chapter 11-clustering: Basic concepts,” Pattern Recognition , pp. 595–625, 2006

2006

Cited alongside, same era.

P. Berkhin, “A survey of clustering data mining techniques,” in Grouping multidimensional data . Springer, 2006, pp. 25–71

2006

Cited alongside, same era.

S. Theodoridis and K. Koutroumbas, “Chapter 14-clustering algorithms iii: Schemes based on function optimization,” Pattern Recognition , pp. 701–763, 2006

2006

Cited alongside, same era.

D. Arthur and S. Vassilvitskii, “k-means++: The advantages of careful seeding,” in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, 2007, pp. 1027–1035

F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in Python,” Journal of Machine Learning Research , vol. 12, pp. 2825–2830, 2011

2011

Later among the works it cites.

S. J. Gershman and D. M. Blei, “A tutorial on bayesian nonparametric models,” Journal of Mathematical Psychology , vol. 56, no. 1, pp. 1–12, 2012

2012

Later among the works it cites.

Z. Ghahramani, “Bayesian non-parametrics and the probabilistic approach to modelling,” Phil. Trans. R. Soc. A , vol. 371, no. 1984, p. 20110553, 2013

2013

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.