A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood

DOI10.1007/s11222-013-9379-3zbMath1325.62013OpenAlexW2001912569MaRDI QIDQ892490

Jianhua Z. Huang, Seokho Lee

Publication date: 19 November 2015

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11222-013-9379-3

zbMATH Keywords

principal component analysisbinary datapenalized likelihoodbiclustering

Mathematics Subject Classification ID

Related Items (6)

Diagonal latent block model for binary data ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ A finite mixture approach to joint clustering of individuals and multivariate discrete outcomes ⋮ Biclustering multivariate discrete longitudinal data ⋮ Convex clustering for binary data ⋮ Three-way clustering of multi-tissue multi-individual gene expression data using semi-nonnegative tensor decomposition

Uses Software

• UCI-ml
• EXPANDER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse logistic principal components analysis for binary data
• Block clustering with collapsed latent block models
• Sparse principal component analysis via regularized low rank matrix approximation
• Principal component analysis of binary data by iterated singular value decomposition
• A mixture of experts model for rank data with applications in election studies
• Block clustering with Bernoulli mixture models: comparison of different approaches
• Estimating the dimension of a model
• Pathwise coordinate optimization
• Variable selection using MM algorithms
• Biclustering via Sparse Singular Value Decomposition
• Estimation of Generalized Linear Latent Variable Models

This page was built for publication: A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood