Abstract: In the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high dimensional genomic data motivates this work. In this context, biclustering enables us to identify subsets of genes that are co-expressed only within a subset of experimental conditions. We present a convex formulation of the biclustering problem that possesses a unique global minimizer and an iterative algorithm, COBRA, that is guaranteed to identify it. Our approach generates an entire solution path of possible biclusters as a single tuning parameter is varied. We also show how to reduce the problem of selecting this tuning parameter to solving a trivial modification of the convex biclustering problem. The key contributions of our work are its simplicity, interpretability, and algorithmic guarantees - features that arguably are lacking in the current alternative algorithms. We demonstrate the advantages of our approach, which includes stably and reproducibly identifying biclusterings, on simulated and real microarray data.
Recommendations
- Convex clustering for binary data
- Statistical properties of convex clustering
- Biclustering via sparse clustering
- Convex clustering method for compositional data modeling
- Convexity-based clustering criteria: theory, algorithms, and applications in statistics
- Sparse Convex Clustering
- scientific article; zbMATH DE number 7370526
- Convex programming based spectral clustering
- Convex clustering analysis for histogram‐valued data
Cites work
- An Algorithm for Restricted Least Squares Regression
- Biclustering in data mining
- Biclustering via sparse singular value decomposition
- Comparing clusterings -- an information based distance
- Coordinate descent algorithms for lasso penalized regression
- Cross-Validatory Estimation of the Number of Components in Factor and Principal Components Models
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Finding large average submatrices in high dimensional data
- scientific article; zbMATH DE number 5564093 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (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?)
- Improved biclustering of microarray data demonstrated through systematic performance tests
- Lasso-type recovery of sparse representations for high-dimensional data
- Limit laws of estimators for critical multi-type Galton-Watson processes
- Pathwise coordinate optimization
- Sparsity and Smoothness Via the Fused Lasso
- Spectral regularization algorithms for learning large incomplete matrices
- The Adaptive Lasso and Its Oracle Properties
- The solution path of the generalized lasso
Cited in
(38)- Variational algorithms for biclustering models
- A dual reformulation and solution framework for regularized convex clustering problems
- Selective inference for latent block models
- BROCCOLI: overlapping and outlier-robust biclustering through proximal stochastic gradient descent
- Tensor clustering with planted structures: statistical optimality and computational limits
- Biclustering via structured regularized matrix decomposition
- Generalized co-clustering analysis via regularized alternating least squares
- Spike-and-slab Lasso biclustering
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
- A biclustering approach based on factor graphs and the max-sum algorithm
- Profile likelihood biclustering
- Feature selection for consistent biclustering via fractional 0-1 programming
- Sparse Convex Clustering
- Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- Bayesian model selection with graph structured sparsity
- Integrative generalized convex clustering optimization and feature selection for mixed multi-view data
- Recovering Trees with Convex Clustering
- Distribution-free, size adaptive submatrix detection with acceleration
- The penalized biclustering model and related algorithms
- scientific article; zbMATH DE number 7306902 (Why is no real title available?)
- Dynamic tensor clustering
- Convex clustering analysis for histogram‐valued data
- Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations
- Uncovering block structures in large rectangular matrices
- Regularized matrix data clustering and its application to image analysis
- A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering
- Biconvex Clustering
- Cluster analysis: a modern statistical review
- Covariate-Dependent Clustering of Undirected Networks with Brain-Imaging Data
- Statistical Foundations Driving 21st Century Innovation
- Computational lower bounds for graphon estimation via low-degree polynomials
- A penalized regression-based biclustering approach in gene expression data
- Resistant convex clustering: how does the fusion penalty enhance resistance?
- Robust convex biclustering with a tuning-free method
- Kernel biclustering algorithm in Hilbert spaces
- Statistical properties of convex clustering
- The Gibbs-plaid biclustering model
This page was built for publication: Convex biclustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347398)
