2014
DOI: 10.1007/s11222-014-9472-2
|View full text |Cite
|
Sign up to set email alerts
|

Estimation and selection for the latent block model on categorical data

Abstract: This paper is dealing with estimation and model selection in the Latent Block Model (LBM) for categorical data. First, after providing sufficient conditions ensuring the identifiability of this model, it generalises estimation procedures and model selection criteria derived for binary data. Secondly, it develops Bayesian inference through Gibbs sampling. And, with a well calibrated non informative prior distribution, Bayesian estimation is proved to avoid the traps encountered by the LBM with the maximum likel… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
95
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 96 publications
(98 citation statements)
references
References 20 publications
3
95
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 1 more Smart Citation
“…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%
“…Alternatively, the E-step can be replaced by a S-step by using a SEM algorithm instead of EM (see details on SEM in Section 2.1). In the S-step, random couples (z, w) (conditionnally to x) are drawn sequentially by the following two-step Gibbs algorithm (see more details in [26]): Z|x, w; θ and W|x, z; θ. Estimating the block membership designed by the pair (z, w) can then be performed by a SE algorithm similar to this one described in Section 2.1.…”
Section: Model-based Co-clusteringmentioning
confidence: 99%
“…Estimation of the block number In addition, a specific expression of the ICL criterion (3) can be invoked for selecting the pair (K, L) (see [32] and [26] which provide ICL expressions for the Gaussian situation and for the Bernoulli/multinomial case, respectively).…”
Section: Model-based Co-clusteringmentioning
confidence: 99%
See 1 more Smart Citation