Unsupervised learning of Gaussian mixture models in the presence of dynamic environments: A multiple-model adaptive algorithm

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper tackles the on-line unsupervised learning problem of Gaussian mixture models in the presence of uncertain dynamic environments. In particular, we assume that the number of Gaussian components (clusters) is unknown and can change over time. We propose a multi-hypothesis adaptive algorithm that continuously updates the number of components and estimates the model parameters as the measurements (sample data) are being acquired. This is done by incrementally maximizing the likelihood probability associated to the estimated parameters and keeping/creating/removing in parallel a number of hypothesis models that are ranked according to the minimum description length (MDL), a well-known concept in information theory. The proposed algorithm has the additional feature that it relaxes "the sufficiently large data set" restriction by not requiring in fact any initial batch of data. Simulation results illustrate the performance of the proposed algorithm. © 2015 Springer International Publishing.

Cite

CITATION STYLE

APA

Khoshrou, A., & Aguiar, A. P. (2015). Unsupervised learning of Gaussian mixture models in the presence of dynamic environments: A multiple-model adaptive algorithm. In Lecture Notes in Electrical Engineering (Vol. 321 LNEE, pp. 387–396). Springer Verlag. https://doi.org/10.1007/978-3-319-10380-8_37

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free