Finding large average submatrices in high dimensional data
From MaRDI portal
Publication:985018
DOI10.1214/09-AOAS239zbMath1196.62087arXiv0905.1682WikidataQ59565445 ScholiaQ59565445MaRDI QIDQ985018
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)
Full work available at URL: https://arxiv.org/abs/0905.1682
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (28)
Energy landscape for large average submatrix detection problems in Gaussian random matrices ⋮ Biclustering via structured regularized matrix decomposition ⋮ Computational barriers to estimation from low-degree polynomials ⋮ Distribution-free detection of a submatrix ⋮ On combinatorial testing problems ⋮ Convex biclustering ⋮ A goodness-of-fit test on the number of biclusters in a relational data matrix ⋮ Finding one community in a sparse graph ⋮ Generalized co-clustering analysis via regularized alternating least squares ⋮ Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time ⋮ Compressed spectral screening for large-scale differential correlation analysis with application in selecting glioblastoma gene modules ⋮ Handling high-dimensional data with missing values by modern machine learning techniques ⋮ Mediation analysis for high-dimensional mediators and outcomes with an application to multimodal imaging data ⋮ Detection of a sparse submatrix of a high-dimensional noisy matrix ⋮ A testing based extraction algorithm for identifying significant communities in networks ⋮ Spike-and-slab Lasso biclustering ⋮ On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory ⋮ Finding a large submatrix of a Gaussian random matrix ⋮ Submatrix localization via message passing ⋮ Biclustering with heterogeneous variance ⋮ Distribution-Free, Size Adaptive Submatrix Detection with Acceleration ⋮ Finding large average submatrices in high dimensional data ⋮ Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix ⋮ Biclustering via Sparse Singular Value Decomposition ⋮ Local spatial biclustering and prediction of urban juvenile delinquency and recidivism ⋮ Multilevel Matrix-Variate Analysis and its Application to Accelerometry-Measured Physical Activity in Clinical Populations ⋮ The overlap gap property in principal submatrix recovery ⋮ Computational barriers in minimax submatrix detection
Uses Software
Cites Work
- Improved biclustering of microarray data demonstrated through systematic performance tests
- Finding large average submatrices in high dimensional data
- Clustering Objects on Subsets of Attributes (with Discussion)
- The minimum description length principle in coding and modeling
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Finding large average submatrices in high dimensional data
