References
- Bishop, C. M. 2006. Mixture models and the EM algorithm. Cambridge: Microsoft Research, , 2006 Advanced Tutorial Lecture Series, CUED edition.
- Bock, H. H. 2008. Origins and extensions of the k-means algorithm in cluster analysis. Journal Electronique d Histoire des Probabilités et de la Statistique Electronic Journal for History of Probability and Statistics 4 (2).
- Cuesta, J., and C. Matrán. 1988. The strong law of large numbers for k-means and best possible nets of Banach valued random variables. Probability Theory and Related Fields 78 (4):523–34. doi:https://doi.org/10.1007/BF00353875.
- Cuesta-Albertos, J. A., C. Matrn, and A. Mayo-Iscar. 2008. Robust estimation in the normal mixture model based on robust clustering. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 70 (4):779–802. doi:https://doi.org/10.1111/j.1467-9868.2008.00657.x.
- Cuesta-Albertos, J. A., A. Gordaliza, and C. Matrán. 1997. Trimmed k-means: An attempt to robustify quantizers. The Annals of Statistics 25 (2):553–76. doi:https://doi.org/10.1214/aos/1031833664.
- Dempster, A. P., N. M. Laird, and D. B. Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (Methodological) 39 (1):1–22. doi:https://doi.org/10.1111/j.2517-6161.1977.tb01600.x.
- Douglas, S. 2011. K-means clustering: A half-century synthesis. British Journal of Mathematical & Statistical Psychology 59 (1):1–34.
- Fisher, W. D. 1958. On grouping for maximum homogeneity. Journal of the American Statistical Association 53 (284):789–98. doi:https://doi.org/10.1080/01621459.1958.10501479.
- Fraley, C., and A. E. Raftery. 1998. How many clusters? Which clustering method? Answers via model-based cluster analysis. The Computer Journal 41 (8):578–88. doi:https://doi.org/10.1093/comjnl/41.8.578.
- García-Escudero, L. Á., and A. Gordaliza. 1999. Robustness properties of k means and trimmed k means. Journal of the American Statistical Association 94 (447):956–69. doi:https://doi.org/10.2307/2670010.
- García-Escudero, L. A., A. Gordaliza, R. San Martin, S. Van Aelst, and R. Zamar. 2009. Robust linear clustering. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 71 (1):301–18. doi:https://doi.org/10.1111/j.1467-9868.2008.00682.x.
- Hartigan, J. 1978. Asymptotic distributions for clustering criteria. The Annals of Statistics 6 (1):117–31. doi:https://doi.org/10.1214/aos/1176344071.
- Hartigan, J. A. 1975. Clustering algorithms. New York: Wiley.
- Hartigan, J. A., and M. A. Wong. 1979. Algorithm AS 136: A k-means clustering algorithm. Applied Statistics 28 (1):100–8. doi:https://doi.org/10.2307/2346830.
- Hastie, T., R. Tibshirani, and J. Friedman. 2005. The elements of statistical learning: Data mining, inference, and prediction. The Mathematical Intelligencer 27 (2):83–5.
- Huang, M., R. Li, H. Wang, and W. Yao. 2014. Estimating mixture of Gaussian processes by kernel smoothing. Journal of Business & Economic Statistics 32 (2):259–70. doi:https://doi.org/10.1080/07350015.2013.868084.
- Huang, M., R. Li, and S. Wang. 2013. Nonparametric mixture of regression models. Journal of the American Statistical Association 108 (503):929–41. doi:https://doi.org/10.1080/01621459.2013.772897.
- Jain, A. K. 2010. Data Clustering: 50 Years Beyond K-means. Pattern Recognition Letters 31 (8):651–66. doi:https://doi.org/10.1016/j.patrec.2009.09.011.
- MacQueen, J. 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, 281–297, Oakland, CA, USA.
- McLachlan, G., and T. Krishnan. 2007. The EM algorithm and extensions. New York: John Wiley & Sons.
- Pollard, D. 1982. A central limit theorem for k-means clustering. The Annals of Probability 10 (4):919–26. pages doi:https://doi.org/10.1214/aop/1176993713.
- Pollard, D. 1981. Strong consistency of k-means clustering. The Annals of Statistics 9 (1):135–40. doi:https://doi.org/10.1214/aos/1176345339.
- Serinko, R. J., and G. J. Babu. 1992. Weak limit theorems for univariate k-mean clustering under a nonregular condition. Journal of Multivariate Analysis 41 (2):273–96. doi:https://doi.org/10.1016/0047-259X(92)90070-V.
- Späth, H., and J. Goldschmidt. 1985. Cluster dissection and analysis: Theory, FORTRAN programs, examples. Chichester: Horwood.
- Sverdrup-Thygeson, H. 1981. Strong law of large numbers for measures of central tendency and dispersion of random variables in compact metric spaces. The Annals of Statistics 9 (1):141–5. doi:https://doi.org/10.1214/aos/1176345340.
- Von Luxburg, U. 2007. A tutorial on spectral clustering. Statistics and Computing 17 (4):395–416. doi:https://doi.org/10.1007/s11222-007-9033-z.
- Witten, D. M., and R. Tibshirani. 2010. A framework for feature selection in clustering. Journal of the American Statistical Association 105 (490):713–26. doi:https://doi.org/10.1198/jasa.2010.tm09415.