An algorithm for unsupervised learning and optimization of finite mixture models

Egyptian Informatics Journal

关键词: Finite Mixture Models;    Expectation–Maximization;    Unsupervised learning;    Clustering;    Optimization;   

DOI  :  10.1016/j.eij.2011.02.005

来源: DOAJ

【 摘 要 】

In this paper, an algorithm is proposed to integrate the unsupervised learning with the optimization of the Finite Mixture Models (FMM). While learning parameters of the FMM the proposed algorithm minimizes the mutual information among components of the FMM provided that the reduction in the likelihood of the FMM to fit the input data is minimized. The performance of the proposed algorithm is compared with the performances of other algorithms in the literature. Results show the superiority of the proposed algorithm over the other algorithms especially with data sets that are sparsely distributed or generated from overlapped clusters.

【 授权许可】

Unknown