A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood

DOI10.1007/S11222-013-9379-3MaRDI QIDQ892490zbMATH OpenOpenAlexFDO

Authors Seokho Lee, Jianhua Z. Huang

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

penalized likelihoodprincipal component analysisbinary databiclustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Profile likelihood biclustering
• Biclustering via structured regularized matrix decomposition
• The penalized biclustering model and related algorithms
• Biclustering via sparse clustering
• Bayesian bi-clustering methods with applications in computational biology

Cites work

• scientific article; zbMATH DE number 3567782 (Why is no real title available?)
• scientific article; zbMATH DE number 1750182 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• A mixture of experts model for rank data with applications in election studies
• Biclustering via sparse singular value decomposition
• Block clustering with Bernoulli mixture models: comparison of different approaches
• Block clustering with collapsed latent block models
• Estimating the dimension of a model
• Estimation of Generalized Linear Latent Variable Models
• Extracting conserved gene expression motifs from gene expression data
• Pathwise coordinate optimization
• Principal component analysis of binary data by iterated singular value decomposition
• Sparse logistic principal components analysis for binary data
• Sparse principal component analysis via regularized low rank matrix approximation
• Variable selection using MM algorithms

Cited in

(15)

• Generalized co-clustering analysis via regularized alternating least squares
• Three-way clustering of multi-tissue multi-individual gene expression data using semi-nonnegative tensor decomposition
• Spike-and-slab Lasso biclustering
• Convex clustering for binary data
• On Boolean representation of continuous data biclustering
• A finite mixture approach to joint clustering of individuals and multivariate discrete outcomes
• Biclustering via structured regularized matrix decomposition
• Profile likelihood biclustering
• Biclustering multivariate discrete longitudinal data
• Diagonal latent block model for binary data
• BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent
• Bayesian bi-clustering methods with applications in computational biology
• Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction
• Multiple day biclustering of high-frequency financial time series
• scientific article; zbMATH DE number 912697 (Why is no real title available?)

Describes a project that uses

Uses Software

• EXPANDER
• UCI

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892490)