Convex Biclustering

08/05/2014
by   Eric C. Chi, et al.
0

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.

READ FULL TEXT

page 2

page 12

page 24

research
02/23/2014

Path Thresholding: Asymptotically Tuning-Free High-Dimensional Sparse Regression

In this paper, we address the challenging problem of selecting tuning pa...
research
09/08/2019

On the connections between algorithmic regularization and penalization for convex losses

In this work we establish the equivalence of algorithmic regularization ...
research
07/23/2018

Algorithm Selection for Collaborative Filtering: the influence of graph metafeatures and multicriteria metatargets

To select the best algorithm for a new problem is an expensive and diffi...
research
09/17/2018

cf2vec: Collaborative Filtering algorithm selection using graph distributed representations

Algorithm selection using Metalearning aims to find mappings between pro...
research
01/06/2019

Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization

Convex clustering is a promising new approach to the classical problem o...
research
01/06/2019

Dynamic Visualization and Fast Computation for Convex Clustering and Bi-Clustering

Convex clustering is a promising new approach to the classical problem o...
research
06/11/2013

DISCOMAX: A Proximity-Preserving Distance Correlation Maximization Algorithm

In a regression setting we propose algorithms that reduce the dimensiona...

Please sign up or login with your details

Forgot password? Click here to reset