Classification EM-PCA for clustering and embedding
By: Zineddine Tighidet, Lazhar Labiod, Mohamed Nadif
Potential Business Impact:
Makes computer groups find patterns faster and better.
The mixture model is undoubtedly one of the greatest contributions to clustering. For continuous data, Gaussian models are often used and the Expectation-Maximization (EM) algorithm is particularly suitable for estimating parameters from which clustering is inferred. If these models are particularly popular in various domains including image clustering, they however suffer from the dimensionality and also from the slowness of convergence of the EM algorithm. However, the Classification EM (CEM) algorithm, a classifying version, offers a fast convergence solution while dimensionality reduction still remains a challenge. Thus we propose in this paper an algorithm combining simultaneously and non-sequentially the two tasks --Data embedding and Clustering-- relying on Principal Component Analysis (PCA) and CEM. We demonstrate the interest of such approach in terms of clustering and data embedding. We also establish different connections with other clustering approaches.
Similar Papers
A Variational Manifold Embedding Framework for Nonlinear Dimensionality Reduction
Machine Learning (CS)
Finds hidden patterns in complex information.
EM Approaches to Nonparametric Estimation for Mixture of Linear Regressions
Methodology
Finds hidden groups in data.
Beyond PCA: Manifold Dimension Estimation via Local Graph Structure
Machine Learning (Stat)
Finds hidden patterns in complicated data.