LAS
From MaRDI portal
Cited in
(28)- Finding a large submatrix of a Gaussian random matrix
- The overlap gap property in principal submatrix recovery
- Biclustering via structured regularized matrix decomposition
- Computational barriers to estimation from low-degree polynomials
- JIVE
- Generalized co-clustering analysis via regularized alternating least squares
- Spike-and-slab Lasso biclustering
- On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
- ESSC
- Computational barriers in minimax submatrix detection
- Energy landscape for large average submatrix detection problems in Gaussian random matrices
- Distribution-free detection of a submatrix
- Detection of a sparse submatrix of a high-dimensional noisy matrix
- Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
- Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
- Biclustering via sparse singular value decomposition
- Matrix eQTL
- FABIA
- Submatrix localization via message passing
- A testing based extraction algorithm for identifying significant communities in networks
- 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
- Convex biclustering
- discordant
- On combinatorial testing problems
- Finding one community in a sparse graph
- Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time
- Finding large average submatrices in high dimensional data
This page was built for software: LAS
