DiscoverStatLearn 2012 - Workshop on "Challenging problems in Statistical Learning"2.3 Discriminative clustering for high-dimensional data (Camille Brunet)
2.3 Discriminative clustering for high-dimensional data (Camille Brunet)

2.3 Discriminative clustering for high-dimensional data (Camille Brunet)

Update: 2014-12-03
Share

Description

A new family of 12 probabilistic models, introduced recently, aims to simultaneously cluster and visualize high-dimensional data. It is based on a mixture model which fits the data into a latent discriminative subspace with an intrinsic dimension bounded by the number of clusters. An estimation procedure, named the Fisher-EM algorithm has also been proposed and turns out to outperform other subspace clustering in most situations. Moreover the convergence properties of the Fisher-EM algorithm are discussed; in particular it is proved that the algorithm is a GEM algorithm and converges under weak conditions in the general case. Finally, a sparse extension of the Fisher-EM algorithm is proposed in order to perform a selection of the original variables which are discriminative.
Comments 
loading
00:00
00:00
1.0x

0.5x

0.8x

1.0x

1.25x

1.5x

2.0x

3.0x

Sleep Timer

Off

End of Episode

5 Minutes

10 Minutes

15 Minutes

30 Minutes

45 Minutes

60 Minutes

120 Minutes

2.3 Discriminative clustering for high-dimensional data (Camille Brunet)

2.3 Discriminative clustering for high-dimensional data (Camille Brunet)

Charles Bouveyron