Clustering in Fisher Discriminative Subspaces - Université Paris 1 Panthéon-Sorbonne Access content directly
Conference Papers Year : 2009

Clustering in Fisher Discriminative Subspaces


Clustering in high-dimensional spaces is nowadays a recurrent problem in many scientific domains but remains a difficult problem. This is mainly due to the fact that high-dimensional data usually live in low-dimensional subspaces hidden in the original space. This paper presents a model-based clustering approach which models the data in a discriminative subspace with an intrinsic dimension lower than the dimension of the original space. An estimation algorithm, called Fisher-EM algorithm, is proposed for estimating both the mixture parameters and the discriminative subspace. Experiments show that the proposed approach outperforms existing clustering methods and provides a useful representation of the high-dimensional data.
Fichier principal
Vignette du fichier
article_amsda.pdf (161.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00375581 , version 1 (15-04-2009)


  • HAL Id : hal-00375581 , version 1


Charles Bouveyron, Camille Brunet. Clustering in Fisher Discriminative Subspaces. 13th International Conference on Applied Stochastic Models and Data Analysis (ASMDA 2009), Jun 2009, Vilnius, Lithuania. (elec. proc). ⟨hal-00375581⟩
275 View
73 Download


Gmail Facebook X LinkedIn More