Christophe Biernacki
Research Subjects
Christophe Biernacki has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
Gilles Celeux
6 shared publicationsGérard Govaert
6 shared publications- Julien Jacques
Université Lumière Lyon 2, Université Lyon 1, ERIC Lyon France
5 shared publications Vincent Vandewalle
Inria, Université de Lille - ULR 2694 Equipe Metrics, Lille, France
5 shared publications- Matthieu Marbac
INRIA Lille, Villeneuve d'Ascq, France
4 shared publications - Christine Keribin
Université Paris-Saclay CNRS Laboratoire de mathématiques d'Orsay 91405 Orsay France
3 shared publications
Latest Publications
- 10 August 2024
- Published by Springer Nature
- p. 27-35
An EM Stopping Rule for Avoiding Degeneracy in Gaussian-Based Clustering with Missing Data
- 10 August 2024
- Published by Springer Nature
- p. 27-35
An EM Stopping Rule for Avoiding Degeneracy in Gaussian-Based Clustering with Missing Data
- Open Access
Comparative study of clustering models for multivariate time series from connected medical devices
In healthcare, patient data is often collected as multivariate time series, providing a comprehensive view of a patient's health status over time. While this data can be sparse, connected devices may enhance its frequency. The goal is to create patient profiles from these time series. In the absence of labels, a predictive model can be used to predict future values while forming a latent cluster space, evaluated based on predictive performance. We compare two models on Withing's datasets, M AGMAC LUST which clusters entire time series and DGM${}^2$ which allows the group affiliation of an individual to change over time (dynamic clustering).
Open AccessComparative study of clustering models for multivariate time series from connected medical devices
In healthcare, patient data is often collected as multivariate time series, providing a comprehensive view of a patient's health status over time. While this data can be sparse, connected devices may enhance its frequency. The goal is to create patient profiles from these time series. In the absence of labels, a predictive model can be used to predict future values while forming a latent cluster space, evaluated based on predictive performance. We compare two models on Withing's datasets, M AGMAC LUST which clusters entire time series and DGM${}^2$ which allows the group affiliation of an individual to change over time (dynamic clustering).
- 17 July 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (2) , 332-381
A Survey on Model-Based Co-Clustering: High Dimension and Estimation Challenges
- 17 July 2023
- Published by Springer Nature in Journal of Classification
- Vol. 40 (2) , 332-381
A Survey on Model-Based Co-Clustering: High Dimension and Estimation Challenges
- 30 March 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (3) , 1-22
Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach
- 30 March 2023
- Published by Springer Nature in Statistics and Computing
- Vol. 33 (3) , 1-22
Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach
- 4 January 2022
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 31 (2) , 477-485
Simultaneous Semiparametric Estimation of Clustering and Regression
We investigate the parameter estimation of regression models with fixed group effects, when the group variable is missing while group-related variables are available. This problem involves clustering to infer the missing group variable based on the group-related variables, and regression to build a model on the target variable given the group and eventually some additional variables. Thus, this problem can be formulated as the joint distribution modeling of the target and of the group-related variables. The usual parameter estimation strategy for this joint model is a two-step approach starting by learning the group variable (clustering step) and then plugging in its estimator for fitting the regression model (regression step). However, this approach is suboptimal (providing in particular biased regression estimates) since it does not make use of the target variable for clustering. Thus, we advise the use of a simultaneous estimation approach of both clustering and regression, in a semi-parametric framework. Numerical experiments illustrate the benefits of our proposition by considering wide ranges of distributions and regression models. The relevance of our new method is illustrated on real data dealing with problems associated with high blood pressure prevention. The proposed approach is implemented in the R package ClusPred available on CRAN. Supplemental materials containing the technical details and the R codes are available online.
- 4 January 2022
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 31 (2) , 477-485
Simultaneous Semiparametric Estimation of Clustering and Regression
We investigate the parameter estimation of regression models with fixed group effects, when the group variable is missing while group-related variables are available. This problem involves clustering to infer the missing group variable based on the group-related variables, and regression to build a model on the target variable given the group and eventually some additional variables. Thus, this problem can be formulated as the joint distribution modeling of the target and of the group-related variables. The usual parameter estimation strategy for this joint model is a two-step approach starting by learning the group variable (clustering step) and then plugging in its estimator for fitting the regression model (regression step). However, this approach is suboptimal (providing in particular biased regression estimates) since it does not make use of the target variable for clustering. Thus, we advise the use of a simultaneous estimation approach of both clustering and regression, in a semi-parametric framework. Numerical experiments illustrate the benefits of our proposition by considering wide ranges of distributions and regression models. The relevance of our new method is illustrated on real data dealing with problems associated with high blood pressure prevention. The proposed approach is implemented in the R package ClusPred available on CRAN. Supplemental materials containing the technical details and the R codes are available online.
- Open Access
Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach
Clustering conceptually reveals all its interest when the dataset size considerably increases since there is the opportunity to discover tiny but possibly high value clusters which were out of reach with more modest sample sizes. However, clustering is practically faced to computer limits with such high data volume, since possibly requiring extremely high memory and computation resources. In addition, the classical subsampling strategy, often adopted to overcome these limitations, is expected to heavily failed for discovering clusters in the highly imbalanced cluster case. Our proposal first consists in drastically compressing the data volume by just preserving its bin-marginal values, thus discarding the bin-cross ones. Despite this extreme information loss, we then prove identifiability property for the diagonal mixture model and also introduce a specific EM-like algorithm associated to a composite likelihood approach. This latter is extremely more frugal than a regular but unfeasible EM algorithm expected to be used on our bin-marginal data, while preserving all consistency properties. Finally, numerical experiments highlight that this proposed method outperforms subsampling both in controlled simulations and in various real applications where imbalanced clusters may typically appear, such as image segmentation, hazardous asteroids recognition and fraud detection.
Open AccessFrugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach
Clustering conceptually reveals all its interest when the dataset size considerably increases since there is the opportunity to discover tiny but possibly high value clusters which were out of reach with more modest sample sizes. However, clustering is practically faced to computer limits with such high data volume, since possibly requiring extremely high memory and computation resources. In addition, the classical subsampling strategy, often adopted to overcome these limitations, is expected to heavily failed for discovering clusters in the highly imbalanced cluster case. Our proposal first consists in drastically compressing the data volume by just preserving its bin-marginal values, thus discarding the bin-cross ones. Despite this extreme information loss, we then prove identifiability property for the diagonal mixture model and also introduce a specific EM-like algorithm associated to a composite likelihood approach. This latter is extremely more frugal than a regular but unfeasible EM algorithm expected to be used on our bin-marginal data, while preserving all consistency properties. Finally, numerical experiments highlight that this proposed method outperforms subsampling both in controlled simulations and in various real applications where imbalanced clusters may typically appear, such as image segmentation, hazardous asteroids recognition and fraud detection.
- 20 May 2021
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 48 (13-15) , 2734-2754
Reject inference methods in credit scoring
The granting process is based on the probability that the applicant will refund his/her loan given his/her characteristics. This probability, also called score, is learnt based on a dataset in which rejected applicants are excluded. Thus, the population on which the score is used is different from the learning population. Many “reject inference” methods try to exploit the data available from the rejected applicants in the learning process. However, most of these methods are empirical and lack of formalization of their assumptions, and of their expected theoretical properties. We formalize such hidden assumptions in a general missing data setting for some of the most common reject inference methods. It reveals that hidden modelling is mostly incomplete, thus prohibiting to compare existing methods within the general model selection mechanism (except by financing “non-fundable” applicants). So, we assess performance of the methods on both simulated data and real data (from CACF, a major European loan issuer). Unsurprisingly, no method seems uniformly dominant. Both these theoretical and empirical results not only reinforce the idea to carefully use the classical reject inference methods but also to invest in future research works for designing model-based reject inference methods (without financing “non-fundable” applicants).
- 20 May 2021
- Published by Taylor & Francis in Journal of Applied Statistics
- Vol. 48 (13-15) , 2734-2754
Reject inference methods in credit scoring
The granting process is based on the probability that the applicant will refund his/her loan given his/her characteristics. This probability, also called score, is learnt based on a dataset in which rejected applicants are excluded. Thus, the population on which the score is used is different from the learning population. Many “reject inference” methods try to exploit the data available from the rejected applicants in the learning process. However, most of these methods are empirical and lack of formalization of their assumptions, and of their expected theoretical properties. We formalize such hidden assumptions in a general missing data setting for some of the most common reject inference methods. It reveals that hidden modelling is mostly incomplete, thus prohibiting to compare existing methods within the general model selection mechanism (except by financing “non-fundable” applicants). So, we assess performance of the methods on both simulated data and real data (from CACF, a major European loan issuer). Unsurprisingly, no method seems uniformly dominant. Both these theoretical and empirical results not only reinforce the idea to carefully use the classical reject inference methods but also to invest in future research works for designing model-based reject inference methods (without financing “non-fundable” applicants).
- Open Access
- 25 February 2021
- Published by Springer Nature
- p. 378-394
Target to Source Coordinate-Wise Adaptation of Pre-trained Models
- 25 February 2021
- Published by Springer Nature
- p. 378-394
Open AccessTarget to Source Coordinate-Wise Adaptation of Pre-trained Models
- Open Access
A bumpy journey: exploring deep Gaussian mixture models
The deep Gaussian mixture model (DGMM) is a framework directly inspired by the finite mixture of factor analysers model (MFA) and the deep learning architecture composed of multiple layers. The MFA is a generative model that considers a data point as arising from a latent variable (termed the score) which is sampled from a standard multivariate Gaussian distribution and then transformed linearly. The linear transformation matrix (termed the loading matrix) is specific to a component in the finite mixture. The DGMM consists of stacking MFA layers, in the sense that the latent scores are no longer assumed to be drawn from a standard Gaussian, but rather are drawn from a mixture of factor analysers model. Thus the latent scores are at one point considered to be the input of an MFA and also to have latent scores themselves. The latent scores of the DGMM's last layer only are considered to be drawn from a standard multivariate Gaussian distribution. In recent years, the DGMM has gained prominence in the literature: intuitively, this model should be able to capture complex distributions more precisely than a simple Gaussian mixture model. We show in this work that while the DGMM is an original and novel idea, in certain cases it is challenging to infer its parameters. In addition, we give some insights to the probable reasons of this difficulty. Experimental results are provided on github: https://github.com/ansubmissions/ICBINB, alongside an R package that implements the algorithm and a number of ready-to-run R scripts.
Open AccessA bumpy journey: exploring deep Gaussian mixture models
The deep Gaussian mixture model (DGMM) is a framework directly inspired by the finite mixture of factor analysers model (MFA) and the deep learning architecture composed of multiple layers. The MFA is a generative model that considers a data point as arising from a latent variable (termed the score) which is sampled from a standard multivariate Gaussian distribution and then transformed linearly. The linear transformation matrix (termed the loading matrix) is specific to a component in the finite mixture. The DGMM consists of stacking MFA layers, in the sense that the latent scores are no longer assumed to be drawn from a standard Gaussian, but rather are drawn from a mixture of factor analysers model. Thus the latent scores are at one point considered to be the input of an MFA and also to have latent scores themselves. The latent scores of the DGMM's last layer only are considered to be drawn from a standard multivariate Gaussian distribution. In recent years, the DGMM has gained prominence in the literature: intuitively, this model should be able to capture complex distributions more precisely than a simple Gaussian mixture model. We show in this work that while the DGMM is an original and novel idea, in certain cases it is challenging to infer its parameters. In addition, we give some insights to the probable reasons of this difficulty. Experimental results are provided on github: https://github.com/ansubmissions/ICBINB, alongside an R package that implements the algorithm and a number of ready-to-run R scripts.
- 10 July 2020
- Published by Springer Nature in Journal of Classification
- Vol. 38 (1) , 129-157
Gaussian-Based Visualization of Gaussian and Non-Gaussian-Based Clustering
- 10 July 2020
- Published by Springer Nature in Journal of Classification
- Vol. 38 (1) , 129-157
Gaussian-Based Visualization of Gaussian and Non-Gaussian-Based Clustering