Model-Based Co-clustering for Ordinal Data - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computational Statistics and Data Analysis Year : 2018

Model-Based Co-clustering for Ordinal Data


A model-based co-clustering algorithm for ordinal data is presented. This algorithm relies on the latent block model embedding a probability distribution specific to ordinal data (the so-called BOS or Binary Ordinal Search distribution). Model inference relies on a Stochastic EM algorithm coupled with a Gibbs sampler, and the ICL-BIC criterion is used for selecting the number of co-clusters (or blocks). The main advantage of this ordinal dedicated co-clustering model is its parsimony, the interpretability of the co-cluster parameters (mode, precision) and the possibility to take into account missing data. Numerical experiments on simulated data show the efficiency of the inference strategy, and real data analyses illustrate the interest of the proposed procedure.
Fichier principal
Vignette du fichier
ordinal-coclustering-Jacques-Biernacki.pdf (2.89 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01448299 , version 1 (27-01-2017)
hal-01448299 , version 2 (28-09-2017)



Julien Jacques, Christophe Biernacki. Model-Based Co-clustering for Ordinal Data. Computational Statistics and Data Analysis, 2018, 123, pp.101-115. ⟨10.1016/j.csda.2018.01.014⟩. ⟨hal-01448299v2⟩
840 View
909 Download



Gmail Facebook X LinkedIn More