Clustering in Fisher Discriminative Subspaces

Abstract : 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.
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal-paris1.archives-ouvertes.fr/hal-00375581
Contributor : Camille Brunet <>
Submitted on : Wednesday, April 15, 2009 - 3:02:11 PM
Last modification on : Tuesday, January 30, 2018 - 5:50:03 PM
Long-term archiving on : Thursday, June 10, 2010 - 8:33:09 PM

File

article_amsda.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00375581, version 1

Citation

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⟩

Share

Metrics

Record views

475

Files downloads

76