Block clustering with collapsed latent block models
From MaRDI portal
Abstract: We introduce a Bayesian extension of the latent block model for model-based block clustering of data matrices. Our approach considers a block model where block parameters may be integrated out. The result is a posterior defined over the number of clusters in rows and columns and cluster memberships. The number of row and column clusters need not be known in advance as these are sampled along with cluster memberhips using Markov chain Monte Carlo. This differs from existing work on latent block models, where the number of clusters is assumed known or is chosen using some information criteria. We analyze both simulated and real data to validate the technique.
Recommendations
- Latent block model for contingency table
- Model selection for Gaussian latent block clustering with the integrated classification likelihood
- Advances in Intelligent Data Analysis VI
- An evolutionary Monte Carlo algorithm for Bayesian block clustering of data matrices
- Model based clustering of high-dimensional binary data
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1222290 (Why is no real title available?)
- scientific article; zbMATH DE number 1085980 (Why is no real title available?)
- scientific article; zbMATH DE number 1750182 (Why is no real title available?)
- scientific article; zbMATH DE number 849921 (Why is no real title available?)
- scientific article; zbMATH DE number 849922 (Why is no real title available?)
- scientific article; zbMATH DE number 849932 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.993
- Bayesian Inference in Hidden Markov Models Through the Reversible Jump Markov Chain Monte Carlo Method
- Bayesian analysis of mixture models with an unknown number of components\,--\,an alternative to reversible jump methods.
- Bloc voting in the United States senate
- Block clustering with Bernoulli mixture models: comparison of different approaches
- Computational and Inferential Difficulties with Mixture Posterior Distributions
- Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions
- Estimating the dimension of a model
- Model-Based Clustering, Discriminant Analysis, and Density Estimation
- Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Statistics for Microarrays
- Unsupervised learning by probabilistic latent semantic analysis
Cited in
(35)- Goodness-of-fit test for latent block models
- A survey on model-based co-clustering: high dimension and estimation challenges
- Selective inference for latent block models
- Co-clustering for binary and functional data
- Optimal Bayesian clustering using non-negative matrix factorization
- Convergence of the groups posterior distribution in latent or stochastic block models
- An evolutionary Monte Carlo algorithm for Bayesian block clustering of data matrices
- Improved Bayesian inference for the stochastic block model with application to large networks
- Co-clustering of spatially resolved transcriptomic data
- The latent topic block model for the co-clustering of textual interaction data
- A finite mixture approach to joint clustering of individuals and multivariate discrete outcomes
- Bayesian variable selection for latent class analysis using a collapsed Gibbs sampler
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels
- Co-clustering of evolving count matrices with the dynamic latent block model: application to pharmacovigilance
- Biclustering models for two-mode ordinal data
- Advances in Intelligent Data Analysis VI
- Biclustering multivariate discrete longitudinal data
- Directional co-clustering
- A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
- Model selection for Gaussian latent block clustering with the integrated classification likelihood
- Diagonal latent block model for binary data
- Network Structure Change Point Detection by Posterior Predictive Discrepancy
- Co-clustering through latent block model: a review
- Functional non-parametric latent block model: a multivariate time series clustering approach for autonomous driving validation
- Clustering microarray data using model-based double \(K\)-means
- Learning from missing data with the binary latent block model
- Noise-free latent block model for high dimensional data
- Optimal Bayesian estimators for latent variable cluster models
- Co-clustering of time-dependent data via the shape invariant model
- Estimation and selection for the latent block model on categorical data
- Choosing the number of clusters in a finite mixture model using an exact integrated completed likelihood criterion
- Finite mixture biclustering of discrete type multivariate data
- Latent block model for contingency table
- Multiple day biclustering of high-frequency financial time series
- scientific article; zbMATH DE number 912697 (Why is no real title available?)
This page was built for publication: Block clustering with collapsed latent block models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746220)
