Biclustering via sparse clustering

DOI10.1111/BIOM.13136MaRDI QIDQ5128808zbMATH OpenOpenAlexWikidataFDO

Authors Erika S. Helgeson, Qian Liu, Guanhua Chen, Michael R. Kosorok, Eric Bair

Publication date 26 October 2020

Published in Biometrics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-means clusteringbiclusteringhierarchical clusteringhigh-dimensional datasparse clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10)

Abstract: In many situations it is desirable to identify clusters that differ with respect to only a subset of features. Such clusters may represent homogeneous subgroups of patients with a disease, such as cancer or chronic pain. We define a bicluster to be a submatrix U of a larger data matrix X such that the features and observations in U differ from those not contained in U. For example, the observations in U could have different means or variances with respect to the features in U. We propose a general framework for biclustering based on the sparse clustering method of Witten and Tibshirani (2010). We develop a method for identifying features that belong to biclusters. This framework can be used to identify biclusters that differ with respect to the means of the features, the variance of the features, or more general differences. We apply these methods to several simulated and real-world data sets and compare the results of our method with several previously published methods. The results of our method compare favorably with existing methods with respect to both predictive accuracy and computing time.

Recommendations

• Identification of relevant subtypes via preweighted sparse clustering
• Spike-and-slab Lasso biclustering
• Bayesian bi-clustering methods with applications in computational biology
• Biclustering via sparse singular value decomposition
• Biclustering with heterogeneous variance

Cited in

(19)

• Identification of relevant subtypes via preweighted sparse clustering
• A simple approach to sparse clustering
• Biclustering analysis of functionals via penalized fusion
• Biclustering via structured regularized matrix decomposition
• Spike-and-slab Lasso biclustering
• Biclustering in data mining
• Bi-objective optimization of biclustering with binary data
• Agglomerative joint clustering of metabolic data with spike at zero: a Bayesian perspective
• Biclustering via sparse singular value decomposition
• A unifying model for biclustering
• Biclustering with heterogeneous variance
• Convex biclustering
• Multidimensional molecular measurements–environment interaction analysis for disease outcomes
• A method for visual identification of small sample subgroups and potential biomarkers
• Kernel biclustering algorithm in Hilbert spaces
• Sparse convex biclustering
• Finding biclusters by random projections
• A biclustering algorithm for binary matrices based on penalized Bernoulli likelihood
• Finding large average submatrices in high dimensional data

This page was built for publication: Biclustering via sparse clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5128808)