Getting Arrays in Order with Convex Biclustering

Computer Science Presentation

Dr. Eric Chi
Assistant Professor of Statistics
North Carolina State University

Getting Arrays in Order with Convex Biclustering

 

In the biclustering problem, we seek to simultaneously group observations and features. 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. The key contributions of our work are its simplicity, interpretability, and algorithmic guarantees. We demonstrate the advantages of our approach, which includes stably and reproducibly identifying biclusterings, on simulated and real high-throughput RNA-Seq data.

Friday, January 13, 2017

11:00 AM — Noon

Manchester Hall, Room 241