Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
arXiv:1101.2374 · doi:10.1007/s11222-011-9249-9
Abstract
Clustering in high-dimensional spaces is nowadays a recurrent problem in many scientific domains but remains a difficult task from both the clustering accuracy and the result understanding points of view. This paper presents a discriminative latent mixture (DLM) model which fits the data in a latent orthonormal discriminative subspace with an intrinsic dimension lower than the dimension of the original space. By constraining model parameters within and between groups, a family of 12 parsimonious DLM models is exhibited which allows to fit onto various situations. An estimation algorithm, called the Fisher-EM algorithm, is also proposed for estimating both the mixture parameters and the discriminative subspace. Experiments on simulated and real datasets show that the proposed approach performs better than existing clustering methods while providing a useful representation of the clustered data. The method is as well applied to the clustering of mass spectrometry data.
References in corpus (1)
Cited by in corpus (11)
- The discriminative functional mixture model for a comparative analysis of bike sharing systems
- Variable Selection Methods for Model-based Clustering
- Clustering, Classification, Discriminant Analysis, and Dimension Reduction via Generalized Hyperbolic Mixtures
- Unsupervised Learning via Mixtures of Skewed Distributions with Hypercube Contours
- Unsupervised classification of SDSS galaxy spectra
- Shaping physical properties of galaxy subtypes in the VIPERS survey: environment matters
- Synergies between low- and intermediate-redshift galaxy populations revealed with unsupervised machine learning
- Reproducible -means clustering in galaxy feature data from the GAMA survey
- Unsupervised classification of CIGALE galaxy spectra
- Machine Learning and galaxy morphology: for what purpose?
- From VIPERS to SDSS: Unveiling galaxy spectra evolution over 9 Gyr through unsupervised machine-learning