Finding large average submatrices in high dimensional data
From MaRDI portal
Publication:985018
DOI10.1214/09-AOAS239zbMATH Open1196.62087arXiv0905.1682WikidataQ59565445 ScholiaQ59565445MaRDI QIDQ985018FDOQ985018
Andrey A. Shabalin, Andrew B. Nobel, Charles M. Perou, Victor J. Weigman
Publication date: 20 July 2010
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Abstract: The search for sample-variable associations is an important problem in the exploratory analysis of high dimensional data. Biclustering methods search for sample-variable associations in the form of distinguished submatrices of the data matrix. (The rows and columns of a submatrix need not be contiguous.) In this paper we propose and evaluate a statistically motivated biclustering procedure (LAS) that finds large average submatrices within a given real-valued data matrix. The procedure operates in an iterative-residual fashion, and is driven by a Bonferroni-based significance score that effectively trades off between submatrix size and average value. We examine the performance and potential utility of LAS, and compare it with a number of existing methods, through an extensive three-part validation study using two gene expression datasets. The validation study examines quantitative properties of biclusters, biological and clinical assessments using auxiliary information, and classification of disease subtypes using bicluster membership. In addition, we carry out a simulation study to assess the effectiveness and noise sensitivity of the LAS search procedure. These results suggest that LAS is an effective exploratory tool for the discovery of biologically relevant structures in high dimensional data. Software is available at https://genome.unc.edu/las/.
Full work available at URL: https://arxiv.org/abs/0905.1682
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Genetics and epigenetics (92D10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved biclustering of microarray data demonstrated through systematic performance tests
- Clustering Objects on Subsets of Attributes (with Discussion)
- The minimum description length principle in coding and modeling
- Finding large average submatrices in high dimensional data
Cited In (29)
- Generalized co-clustering analysis via regularized alternating least squares
- Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules
- On combinatorial testing problems
- Spike-and-slab Lasso biclustering
- Local spatial biclustering and prediction of urban juvenile delinquency and recidivism
- Mediation analysis for high-dimensional mediators and outcomes with an application to multimodal imaging data
- Finding a large submatrix of a Gaussian random matrix
- Computational barriers in minimax submatrix detection
- Distribution-Free, Size Adaptive Submatrix Detection with Acceleration
- Biclustering via Sparse Singular Value Decomposition
- Handling high-dimensional data with missing values by modern machine learning techniques
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
- Convex biclustering
- Biclustering via structured regularized matrix decomposition
- A goodness-of-fit test on the number of biclusters in a relational data matrix
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Computational barriers to estimation from low-degree polynomials
- Statistical mechanics of the maximum-average submatrix problem
- A testing based extraction algorithm for identifying significant communities in networks
- Submatrix localization via message passing
- The overlap gap property in principal submatrix recovery
- Distribution-free detection of a submatrix
- Finding large average submatrices in high dimensional data
- Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations
- Biclustering with heterogeneous variance
- Energy landscape for large average submatrix detection problems in Gaussian random matrices
- Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
- Finding one community in a sparse graph
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
Uses Software
This page was built for publication: Finding large average submatrices in high dimensional data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q985018)
