Integrative Generalized Convex Clustering Optimization and Feature Selection for Mixed Multi-View Data

Abstract

In mixed multi-view data, multiple sets of diverse features are measured on the same set of samples. By integrating all available data sources, we seek to discover common group structure among the samples that may be hidden in individualistic cluster analyses of a single data-view. While several techniques for such integrative clustering have been explored, we propose and develop a convex formalization that will inherit the strong statistical, mathematical and empirical properties of increasingly popular convex clustering methods. Specifically, our Integrative Generalized Convex Clustering Optimization (iGecco) method employs different convex distances, losses, or divergences for each of the different data views with a joint convex fusion penalty that leads to common groups. Additionally, integrating mixed multi-view data is often challenging when each data source is high-dimensional. To perform feature selection in such scenarios, we develop an adaptive shifted group-lasso penalty that selects features by shrinking them towards their loss-specific centers. Our so-called iGecco+ approach selects features from each data-view that are best for determining the groups, often leading to improved integrative clustering. To fit our model, we develop a new type of generalized multi-block ADMM algorithm using sub-problem approximations that more efficiently fits our model for big data sets. Through a series of numerical experiments and real data examples on text mining and genomics, we show that iGecco+ achieves superior empirical performance for high-dimensional mixed multi-view data.

References in corpus (13)

• Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
• Joint and individual variation explained (JIVE) for integrated analysis of multiple data types
• Bayesian Consensus Clustering
• All-at-once Optimization for Coupled Matrix and Tensor Factorizations
• Sparse integrative clustering of multiple omics data sets
• Sparse Convex Clustering
• A Blockwise Descent Algorithm for Group-penalized Multiresponse and Multinomial Regression
• Linearized Alternating Direction Method with Parallel Splitting and Adaptive Penalty for Separable Convex Programs in Machine Learning
• Provable Convex Co-clustering of Tensors
• Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
• Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting
• Integrated Principal Components Analysis
• Identifying cancer subtypes in glioblastoma by combining genomic, transcriptomic and epigenomic data

Cited by in corpus (3)

• Fast and Interpretable Consensus Clustering via Minipatch Learning
• Simple and Scalable Sparse k-means Clustering via Feature Ranking
• Supervised Convex Clustering