A novel adaptive methodology for removing spurious components in a modified incremental Gaussian mixture model
Regarding the computational complexity of the update procedure in the fast incremental Gaussian mixture model (FIGMM) and no efficiency for removing the spurious component in the incremental Gaussian mixture model (IGMM), this study proposes a novel algorithm called the modified incremental Gaussian...
Gespeichert in:
Veröffentlicht in: | International journal of machine learning and cybernetics 2023-02, Vol.14 (2), p.551-566 |
---|---|
Hauptverfasser: | , , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Regarding the computational complexity of the update procedure in the fast incremental Gaussian mixture model (FIGMM) and no efficiency for removing the spurious component in the incremental Gaussian mixture model (IGMM), this study proposes a novel algorithm called the modified incremental Gaussian mixture model (MIGMM) which is an improvement of FIGMM, and a novel adaptive methodology for removing spurious components in the MIGMM. The major contributions in this study are twofold. Firstly, a more simple and efficient prediction matrix update, which is the core of the update procedure in the MIGMM algorithm, is proposed compared to that described in FIGMM. Secondly, an effective exponential model (
p
Thv
) related to the number of output components generated in MIGMM, combined with the Mahalanobis distance-based logical matrix (LM), is proposed to remove spurious components and determine the correct components. Based on the highlighted contributions, regarding the removal of spurious components, comparative experiments studied on synthetic and real data sets show that the proposed framework performs robustly compared with other famous information criteria used to determine the number of components. The performance evaluation of IGMM compared with other efficient unsupervised algorithms is verified by conducting on both synthetic and real-world data sets. |
---|---|
ISSN: | 1868-8071 1868-808X |
DOI: | 10.1007/s13042-022-01649-w |