On the estimation of the latent discriminative subspace in the Fisher-EM algorithm

The Fisher-EM algorithm has been recently proposed in [2] for the simultaneous visualization and clustering of high-dimensional data. It is based on a discriminative latent mixture model which fits the data into a latent discriminative subspace with an intrinsic dimension lower than the dimension of the original space. The Fisher-EM algorithm includes an F-step which estimates the projection matrix whose columns span the discriminative latent space. This matrix is estimated via an optimization problem which is solved using a Gram-Schmidt procedure in the original algorithm. Unfortunately, this procedure suffers in some case from numerical instabilities which may result in a deterioration of the visualization quality or the clustering accuracy. Two alternatives for estimating the latent subspace are proposed to overcome this limitation. The optimization problem of the F-step is first recasted as a regression-type problem and then reformulated such that the solution can be approximated with a SVD. Experiments on simulated and real datasets show the improvement of the proposed alternatives for both the visualization and the clustering of data.

• Publication year

  2012

• Venue

  Unknown venue

• Publication date

  2012-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dimensionally reduced mixtures of regression models

  2011cited by this paper
• Simultaneous model-based clustering and visualization in the Fisher discriminative subspace

  2011influential reference
• Heteroscedastic factor mixture analysis

  2010cited by this paper
• Model-based clustering of microarray expression data via latent Gaussian mixture models

  2010cited by this paper
• A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis.

  2009cited by this paper
• Variable selection in model-based clustering: A general variable role modeling

  2009cited by this paper
• Sparse Linear Discriminant Analysis with Applications to High Dimensional Low Sample Size Data

  2009influential reference
• Parsimonious Gaussian mixture models

  2008cited by this paper
• High-dimensional data clustering

  2006cited by this paper
• Variable Selection for Model-Based Clustering

  2006cited by this paper
• Introduction to Statistical Pattern Recognition

  2006cited by this paper
• Auto-associative models and generalized principal component analysis

  2005cited by this paper
• A mixed factors model for dimension reduction and extraction of a group structure in gene expression data

  2004cited by this paper
• Modelling high-dimensional data by mixtures of factor analyzers

  2003cited by this paper
• A Database for Handwritten Text Recognition Research

  1994cited by this paper
• A note on the orthonormal discriminant vector method for feature extraction

  1991cited by this paper
• Matrix computations

  1983cited by this paper
• On using Principal Components before Separating a Mixture of Two Multivariate Normal Distributions

  1983cited by this paper
• An Optimal Set of Discriminant Vectors

  1975cited by this paper
• THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS

  1936cited by this paper

• FEM-DBSCAN: An Efficient Density-Based Clustering Approach

  2021cites this paper
• A Bayesian Fisher-EM algorithm for discriminative Gaussian subspace clustering

  2020cites this paper
• Model-Based Clustering and Classification for Data Science

  2019cites this paper
• Variable Selection

  2019cites this paper
• Model-Based Clustering and Classification for Data Science: With Applications in R

  2019cites this paper
• High-dimensional Data

  2019cites this paper
• Other Topics

  2019cites this paper
• Network data

  2019cites this paper
• Dealing with Difficulties

  2019cites this paper
• Discrete Data Clustering

  2019cites this paper
• Preface

  2019cites this paper
• Non-Gaussian Model-based Clustering

  2019cites this paper
• Model-based Clustering with Covariates

  2019cites this paper
• Model-based Clustering: Basic Ideas

  2019cites this paper
• Semi-supervised Clustering and Classification

  2019cites this paper
• Introduction

  2019cites this paper
• Bibliography

  2019cites this paper
• Model-based Classification

  2019cites this paper
• Model-based clustering of high-dimensional data in Astrophysics

  2016cites this paper
• Model-based clustering of high-dimensional data: A review

  2014cites this paper
• Contributions à l'apprentissage statistique en grande dimension, adaptatif et sur données atypiques

  2012cites this paper
• Subject Index

  1984cites this paper