Skip to Main content Skip to Navigation
Journal articles

Co-clustering of ordinal data via latent continuous random variables and not missing at random entries

Marco Corneli 1, 2 Charles Bouveyron 1, 2 Pierre Latouche 3
2 MAASAI - Modèles et algorithmes pour l’intelligence artificielle
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - SPARKS - Scalable and Pervasive softwARe and Knowledge Systems, UNS - Université Nice Sophia Antipolis (... - 2019), JAD - Laboratoire Jean Alexandre Dieudonné
Abstract : This paper is about the co-clustering of ordinal data. Such data are very common on e-commerce platforms where customers rank the products/services they bought. More in details, we focus on arrays of ordinal (possibly missing) data involving two disjoint sets of individuals/objects corresponding to the rows/columns of the arrays. Typically, an observed entry (i, j) in the array is an ordinal score assigned by the individual/row i to the object/column j. A generative model for arrays of ordinal data is introduced along with an inference algorithm for parameters estimation. The model relies on latent continuous random variables and the fitting allows to simultaneously co-cluster the rows and columns of an array. The estimation of the model parameters is performed via a classification expectation maximization (C-EM) algorithm. A model selection criterion is formally obtained to select the number of row and column clusters. In order to show that our approach reaches and often outperforms the state of the art, we carry out numerical experiments on synthetic data. Finally, applications on real datasets highlight the model capacity to deal with very sparse arrays.
Document type :
Journal articles
Complete list of metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01978174
Contributor : Marco Corneli <>
Submitted on : Friday, January 11, 2019 - 12:41:21 PM
Last modification on : Wednesday, October 14, 2020 - 3:39:04 AM
Long-term archiving on: : Friday, April 12, 2019 - 2:01:09 PM

File

OrdinalLBM.pdf
Files produced by the author(s)

Identifiers

Citation

Marco Corneli, Charles Bouveyron, Pierre Latouche. Co-clustering of ordinal data via latent continuous random variables and not missing at random entries. Journal of Computational and Graphical Statistics, Taylor & Francis, 2020, ⟨10.1080/10618600.2020.1739533⟩. ⟨hal-01978174⟩

Share

Metrics

Record views

477

Files downloads

480