Learning from missing data with the binary latent block model
- 20 December 2021
- journal article
- research article
- Published by Springer Nature in Statistics and Computing
- Vol. 32 (1) , 1-21
Abstract
No abstract availableKeywords
All Related Versions
This publication has 30 references indexed in Scilit:
- From $K$-Means to Higher-Way Co-Clustering: Multilinear Decomposition With Sparse Latent FactorsIEEE Transactions on Signal Processing, 2012
- Spectral clustering and the high-dimensional stochastic blockmodelThe Annals of Statistics, 2011
- Block clustering with collapsed latent block modelsStatistics and Computing, 2011
- Overlapping stochastic block models with application to the French political blogosphereThe Annals of Applied Statistics, 2011
- Latent Block Model for Contingency TableCommunications in Statistics - Theory and Methods, 2010
- Uniting pattern and process in plant–animal mutualistic networks: a reviewAnnals of Botany, 2009
- Block clustering with Bernoulli mixture models: Comparison of different approachesComputational Statistics & Data Analysis, 2008
- Spectral Biclustering of Microarray Data: Coclustering Genes and ConditionsGenome Research, 2003
- Choosing starting values for the EM algorithm for getting the highest likelihood in multivariate Gaussian mixture modelsComputational Statistics & Data Analysis, 2003
- Inference and missing dataBiometrika, 1976