Model-based Clustering of High-dimensional Data Streams with Online Mixture of Probabilistic PCA
Résumé
Model-based clustering is a popular tool which is renowned for its probabilistic foundations and its flexibility. However, model-based clustering techniques usually perform poorly when dealing with high-dimensional data streams, which are nowadays a frequent data type. To overcome this limitation of model-based clustering, we propose an online inference algorithm for the mixture of probabilistic PCA model. The proposed algorithm relies on an EM-based procedure and on a probabilistic and incremental version of PCA. Model selection is also considered in the online setting through parallel computing. Numerical experiments on simulated and real data demonstrate the effectiveness of our approach and compare it to sate-of-the-art online EM-based algorithms.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...