2018
DOI: 10.1016/j.csda.2018.01.014
|View full text |Cite
|
Sign up to set email alerts
|

Model-based co-clustering for ordinal data

Abstract: 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 t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 53 publications
(21 citation statements)
references
References 23 publications
0
21
0
Order By: Relevance
“…In particular, Keribin et al . () detailed how to express ICL‐BIC for the general case of categorical data and Jacques and Biernacki () for the specific case of ordinal data by using the BOS model. In the present work, ICL‐BIC is therefore adapted for the constrained latent block model:ICL‐BIC(G,H1,,HD)=log{pfalse(truex^,truev^,boldwfalse^1,,boldwfalse^D;trueθ^false)}G12logfalse(Nfalse)false∑dHd12logfalse(Jdfalse)false∑dGHd2logfalse(NJdfalse),where boldvfalse^,truew^1,,truew^D are the row and column partitions that are discovered by the SEM algorithm, and trueθ^ is the corresponding estimated model parameter.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In particular, Keribin et al . () detailed how to express ICL‐BIC for the general case of categorical data and Jacques and Biernacki () for the specific case of ordinal data by using the BOS model. In the present work, ICL‐BIC is therefore adapted for the constrained latent block model:ICL‐BIC(G,H1,,HD)=log{pfalse(truex^,truev^,boldwfalse^1,,boldwfalse^D;trueθ^false)}G12logfalse(Nfalse)false∑dHd12logfalse(Jdfalse)false∑dGHd2logfalse(NJdfalse),where boldvfalse^,truew^1,,truew^D are the row and column partitions that are discovered by the SEM algorithm, and trueθ^ is the corresponding estimated model parameter.…”
Section: Methodsmentioning
confidence: 99%
“…The key point is that the dependence structure vanishes as the ICL relies on the complete latent block information .v, w/, instead of integrating it out as is the case for the BIC. In particular, Keribin et al (2015) detailed how to express ICL-BIC for the general case of categorical data and Jacques and Biernacki (2018) for the specific case of ordinal data by using the BOS model. In the present work, ICL-BIC is therefore adapted for the constrained latent block model: ICL-BIC.G, H 1 , : : : , H D / = log{p.x,v,ŵ 1 , : : :…”
Section: Model Selectionmentioning
confidence: 99%
See 1 more Smart Citation
“…Bonzo and Hermosilla (2002) first introduced multivariate statistical methods into panel data analysis and used probabilistic connection functions to improve clustering analysis algorithms for panel data analysis [5]. Subsequent research involves fixed effect [6], time series [2,7], ordinal data [8], parameter estimation [9,10], etc. However, the statistical method performs cluster analysis, which has certain requirements on the number of samples.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, the large data matrix can be summarized by a reduced number of blocks of data (or co-clusters). If the earliest (and most cited) method is probably due to Hartigan (1972), model-based approaches have recently proved their efficiency either for continuous, binary, categorical or contingency data (Govaert and Nadif, 2013;Jacques and Biernacki, 2017). Those approaches rely on the latent block model (LBM) (Govaert and Nadif, 2013), which tackles combinatorial issues by assuming local independence, i.e.…”
Section: Introductionmentioning
confidence: 99%