Model-Based Co-clustering for Functional Data
Type de document :
Compte-rendu et recension critique d'ouvrage
Titre :
Model-Based Co-clustering for Functional Data
Auteur(s) :
Slimen, Yosra [Auteur]
Orange Labs [Belfort] [Orange Labs]
Entrepôts, Représentation et Ingénierie des Connaissances [ERIC]
Allio, Sylvain [Auteur]
Orange Labs [Belfort] [Orange Labs]
Jacques, Julien [Auteur]
MOdel for Data Analysis and Learning [MODAL]
Entrepôts, Représentation et Ingénierie des Connaissances [ERIC]
Orange Labs [Belfort] [Orange Labs]
Entrepôts, Représentation et Ingénierie des Connaissances [ERIC]
Allio, Sylvain [Auteur]
Orange Labs [Belfort] [Orange Labs]
Jacques, Julien [Auteur]
MOdel for Data Analysis and Learning [MODAL]
Entrepôts, Représentation et Ingénierie des Connaissances [ERIC]
Titre de la revue :
Neurocomputing
Pagination :
97-108
Éditeur :
Elsevier
Date de publication :
2018-05-24
ISSN :
0925-2312
Mot(s)-clé(s) en anglais :
co-clustering
functional data
SEM-Gibbs algorithm
latent block model
ICL-BIC criterion
mobile network
key performance indicators
functional data
SEM-Gibbs algorithm
latent block model
ICL-BIC criterion
mobile network
key performance indicators
Discipline(s) HAL :
Mathématiques [math]/Statistiques [math.ST]
Résumé en anglais : [en]
In order to provide a simplified representation of key performance indicators for an easier analysis by mobile network maintainers, a model-based co-clustering algorithm for functional data is proposed. Co-clustering aims ...
Lire la suite >In order to provide a simplified representation of key performance indicators for an easier analysis by mobile network maintainers, a model-based co-clustering algorithm for functional data is proposed. Co-clustering aims to identify block patterns in a data set from a simultaneous clustering of rows and columns. The algorithm relies on the latent block model in which each curve is identified by its functional principal components that are modeled by a multivariate Gaussian distribution whose parameters are block-specific. These latter are estimated by a stochastic EM algorithm embedding a Gibbs sampling. In order to select the numbers of row-and column-clusters, an ICL-BIC criterion is introduced. In addition to be the first co-clustering algorithm for functional data, the advantage of the proposed model is its ability to extract the hidden double structure induced by the data and its ability to deal with missing values. The model has proven its efficiency on simulated data and on a real data application that helps to optimize the topology of 4G mobile networks.Lire moins >
Lire la suite >In order to provide a simplified representation of key performance indicators for an easier analysis by mobile network maintainers, a model-based co-clustering algorithm for functional data is proposed. Co-clustering aims to identify block patterns in a data set from a simultaneous clustering of rows and columns. The algorithm relies on the latent block model in which each curve is identified by its functional principal components that are modeled by a multivariate Gaussian distribution whose parameters are block-specific. These latter are estimated by a stochastic EM algorithm embedding a Gibbs sampling. In order to select the numbers of row-and column-clusters, an ICL-BIC criterion is introduced. In addition to be the first co-clustering algorithm for functional data, the advantage of the proposed model is its ability to extract the hidden double structure induced by the data and its ability to deal with missing values. The model has proven its efficiency on simulated data and on a real data application that helps to optimize the topology of 4G mobile networks.Lire moins >
Langue :
Anglais
Vulgarisation :
Non
Collections :
Source :
Fichiers
- document
- Accès libre
- Accéder au document
- coclustering_functional_data.pdf
- Accès libre
- Accéder au document
- Functional-coclust.pdf
- Accès libre
- Accéder au document