Online Program Home
  My Program

All Times EDT

Abstract Details

Activity Number: 288 - SLDS CSpeed 5
Type: Contributed
Date/Time: Wednesday, August 11, 2021 : 1:30 PM to 3:20 PM
Sponsor: Section on Statistical Learning and Data Science
Abstract #317719
Title: A New Algorithm for Convex Biclustering and Its Extension to the Compositional Data
Author(s): Binhuan Wang* and Lanqiu Yao and Jiyuan Hu and Huilin Li
Companies: NYU School of Medicine and New York University and New York University Grossman School of Medicine and New York University Grossman School of Medicine
Keywords: Compositional data; Convex biclustering; Microbiome data; Sylvester Equation
Abstract:

Biclustering is a powerful data mining technique that allows simultaneously clustering rows (observations) and columns (features) in a matrix-format data set, which can provide results in a checkerboard-like pattern for visualization and exploratory analysis in a wide array of domains. Multiple biclustering algorithms have been developed in the past two decades, among which the convex biclustering can guarantee a global optimum by formulating in as a convex optimization problem. On the other hand, the application of biclustering has not progressed in parallel with the algorithm design. For example, biclustering for increasingly popular microbiome research data is under-applied, and one reason may be its compositional constraints. In this manuscript, we propose a new convex biclustering algorithm under general setups based on the ADMM algorithm, which is free of extra smoothing steps to visualize informative biclusters. Furthermore, we tailor it to the algorithm named biC-ADMM specifically to tackle compositional constraints confronted in microbiome data. The key step of our methods utilizes the Sylvester which is new to the clustering research.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2021 program