Convex biclustering

DOI10.1111/biom.12540zbMath1366.62208arXiv1408.0856OpenAlexW3037425903WikidataQ39779484 ScholiaQ39779484MaRDI QIDQ5347398

Eric C. Chi, Richard G. Baraniuk, Genevera I. Allen

Publication date: 23 May 2017

Published in: Biometrics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.0856

zbMATH Keywords

convex optimizationclusteringgene expressionstructured sparsitybiclusteringreproducible researchfused Lasso

Mathematics Subject Classification ID

Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Convex programming (90C25) Protein sequences, DNA sequences (92D20)

Related Items

Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Biclustering via structured regularized matrix decomposition ⋮ Unnamed Item ⋮ Statistical properties of convex clustering ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Uncovering block structures in large rectangular matrices ⋮ Regularized matrix data clustering and its application to image analysis ⋮ Unnamed Item ⋮ Biconvex Clustering ⋮ A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering ⋮ On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory ⋮ Distribution-Free, Size Adaptive Submatrix Detection with Acceleration ⋮ A dual reformulation and solution framework for regularized convex clustering problems ⋮ Dynamic Tensor Clustering ⋮ Profile likelihood biclustering ⋮ Selective inference for latent block models ⋮ 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 ⋮ Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations ⋮ Unnamed Item ⋮ Recovering Trees with Convex Clustering

Uses Software

• seriation
• ElemStatLearn
• softImpute
• dynamicTreeCut
• LAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved biclustering of microarray data demonstrated through systematic performance tests
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• The Adaptive Lasso and Its Oracle Properties
• The solution path of the generalized lasso
• Finding large average submatrices in high dimensional data
• Lasso-type recovery of sparse representations for high-dimensional data
• Limit laws of estimators for critical multi-type Galton-Watson processes
• Comparing clusterings -- an information based distance
• Pathwise coordinate optimization
• Biclustering in data mining
• Coordinate descent algorithms for lasso penalized regression
• Biclustering via Sparse Singular Value Decomposition
• An Algorithm for Restricted Least Squares Regression
• Cross-Validatory Estimation of the Number of Components in Factor and Principal Components Models
• Sparsity and Smoothness Via the Fused Lasso