Charles Bouveyron
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Charles Bouveyron has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Camille Brunet
FRE CNRS IBISC TADIB 3190
2 shared publications - Anastasios Bellas
SAMM (EA 4543), Université Paris 1, Paris Cedex 13, France
1 shared publication Camille Brunet
Equipe Modal’X, EA 3454, Université Paris Ouest Nanterre La Defense, 200 av. de la République, 92000 Nanterre, France
1 shared publication- Camille Brunet-Saumard
Laboratoire LAREMA, UMR CNRS 6093, Université d’Angers, Angers, France
1 shared publication Cordelia Schmid
INRIA Rhône-Alpes
1 shared publication- Julien Jacques
Univ Lille 1, UMR CNRS 8524, Lab Paul Painleve, Lille, France
1 shared publication
Latest Publications
- Open Access
- 29 March 2014
- Published by Springer Nature in Journal of Classification
- Vol. 31 (1) , 49-84
Adaptive Mixture Discriminant Analysis for Supervised Learning with Unobserved Classes
- 29 March 2014
- Published by Springer Nature in Journal of Classification
- Vol. 31 (1) , 49-84
Open AccessAdaptive Mixture Discriminant Analysis for Supervised Learning with Unobserved Classes
- Open Access
- 20 July 2013
- Published by Springer Nature in Computational Statistics
- Vol. 29 (3-4) , 489-513
Discriminative variable selection for clustering with the sparse Fisher-EM algorithm
- 20 July 2013
- Published by Springer Nature in Computational Statistics
- Vol. 29 (3-4) , 489-513
Open AccessDiscriminative variable selection for clustering with the sparse Fisher-EM algorithm
- 25 May 2013
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 7 (3) , 281-300
Model-based clustering of high-dimensional data streams with online mixture of probabilistic PCA
- 25 May 2013
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 7 (3) , 281-300
Model-based clustering of high-dimensional data streams with online mixture of probabilistic PCA
- 31 August 2012
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 109, 29-41
Theoretical and practical considerations on the convergence properties of the Fisher-EM algorithm
- 31 August 2012
- Published by Elsevier in Journal of Multivariate Analysis
- Vol. 109, 29-41
Theoretical and practical considerations on the convergence properties of the Fisher-EM algorithm
- 22 October 2011
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 5 (4) , 281-300
Model-based clustering of time series in group-specific functional subspaces
- 22 October 2011
- Published by Springer Nature in Advances in Data Analysis and Classification
- Vol. 5 (4) , 281-300
Model-based clustering of time series in group-specific functional subspaces
- Open Access
Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
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.
Open AccessSimultaneous model-based clustering and visualization in the Fisher discriminative subspace
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.
- 13 April 2011
- Published by Springer Nature in Statistics and Computing
- Vol. 22 (1) , 301-324
Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
- 13 April 2011
- Published by Springer Nature in Statistics and Computing
- Vol. 22 (1) , 301-324
Simultaneous model-based clustering and visualization in the Fisher discriminative subspace
- 13 October 2007
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 36 (14) , 2607-2623
High-Dimensional Discriminant Analysis
We propose a new discriminant analysis method for high-dimensional data, called High-Dimensional Discriminant Analysis (HDDA). Our approach is based on the assumption that high-dimensional data live in different subspaces with low dimensionality. We therefore propose a new parameterization of the Gaussian model which combines the ideas of dimension reduction and constraints on the model. This parameterization takes into account the specific subspace and the intrinsic dimension of each class to limit the number of parameters to estimate. In addition, it is possible to make additional assumptions on the model to further limit the number of parameters. Our experiments on artificial and real datasets highlight that HDDA is more efficient than classical methods in high-dimensional spaces and with small learning datasets.
- 13 October 2007
- Published by Taylor & Francis in Communications in Statistics - Theory and Methods
- Vol. 36 (14) , 2607-2623
High-Dimensional Discriminant Analysis
We propose a new discriminant analysis method for high-dimensional data, called High-Dimensional Discriminant Analysis (HDDA). Our approach is based on the assumption that high-dimensional data live in different subspaces with low dimensionality. We therefore propose a new parameterization of the Gaussian model which combines the ideas of dimension reduction and constraints on the model. This parameterization takes into account the specific subspace and the intrinsic dimension of each class to limit the number of parameters to estimate. In addition, it is possible to make additional assumptions on the model to further limit the number of parameters. Our experiments on artificial and real datasets highlight that HDDA is more efficient than classical methods in high-dimensional spaces and with small learning datasets.