Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2019.0001
Investigation of the optimal number of clusters by the adaptive EM algorithm
Vedran Novoselac
orcid.org/0000-0002-3505-4207
; Mechanical Engineering Faculty in Slavonski Brod, J. J. Strossmayer University of Osijek, Slavonski Brod, Croatia
Sažetak
This paper considers the investigation of the optimal number of clusters for datasets that are modeled as the Gaussian mixture. For that purpose, the adaptive method that is based on a modified Expectation Maximization (EM) algorithm is developed. The modification is conducted within the hidden variable of the standard EM algorithm. Assuming that data are multivariate normally distributed, where each component of the Gaussian mixture corresponds to one cluster, the modification is provided by utilizing the fact that the Mahalanobis distance of samples follows a Chi-square distribution. Besides, the quantity measure is constructed in order to determine number of clusters. The proposed method is presented in several numerical examples.
Ključne riječi
chi-square; clustering; EM algorithm; Gaussian mixture; Mahalanobis distance
Hrčak ID:
222077
URI
Datum izdavanja:
4.7.2019.
Posjeta: 1.689 *