SIAM Journal on Scientific and Statistical Computing
Optimization Algorithms on Matrix Manifolds
Optimization Algorithms on Matrix Manifolds
Model-based cluster and discriminant analysis with the MIXMOD software
Computational Statistics & Data Analysis
Hi-index | 0.00 |
Within the mixture model-based clustering literature, parsimonious models with eigen-decomposed component covariance matrices have dominated for over a decade. Although originally introduced as a fourteen-member family of models, the current state-of-the-art is to utilize just ten of these models; the rationale for not using the other four models usually centers around parameter estimation difficulties. Following close examination of these four models, we find that two are actually easily implemented using existing algorithms but that two benefit from a novel approach. We present and implement algorithms that use an accelerated line search for optimization on the orthogonal Stiefel manifold. Furthermore, we show that the `extra' models that these decompositions facilitate outperform the current state-of-the art when applied to two benchmark data sets.