We present new initialization methods for the expectationmaximization algorithm for multivariate Gaussian mixture models. Our methods are adaptions of the well-known K-means++ initialization and the Gonzalez algorithm. Thereby we aim to close the gap between simple random, e.g. uniform, and complex methods, that crucially depend on the right choice of hyperparameters. Our extensive experiments indicate the usefulness of our methods compared to common techniques and methods, which e.g. apply the original K-means++ and Gonzalez directly, with respect to artificial as well as real-world data sets.
CITATION STYLE
Blömer, J., & Bujna, K. (2016). Adaptive seeding for Gaussian mixture models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9652 LNAI, pp. 296–308). Springer Verlag. https://doi.org/10.1007/978-3-319-31750-2_24
Mendeley helps you to discover research relevant for your work.