LAS

swMATH17180MaRDI QIDQ29041FDOQ29041

Author name not available (Why is that?)

Cited In (23)

• Generalized co-clustering analysis via regularized alternating least squares
• On combinatorial testing problems
• Spike-and-slab Lasso biclustering
• Local spatial biclustering and prediction of urban juvenile delinquency and recidivism
• Finding a large submatrix of a Gaussian random matrix
• Computational barriers in minimax submatrix detection
• Biclustering via Sparse Singular Value Decomposition
• On uniform concentration bounds for bi-clustering by using the Vapnik-Chervonenkis theory
• Convex biclustering
• Biclustering via structured regularized matrix decomposition
• Detection of a sparse submatrix of a high-dimensional noisy matrix
• Computational barriers to estimation from low-degree polynomials
• 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
• Statistical-computational tradeoffs in planted problems and submatrix localization with a growing number of clusters and submatrices
• 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

This page was built for software: LAS