Detection of a sparse submatrix of a high-dimensional noisy matrix
暂无分享,去创建一个
[1] D. Donoho,et al. Higher criticism for detecting sparse heterogeneous mixtures , 2004, math/0410072.
[2] Yu. I. Ingster,et al. Detection of a signal of known shape in a multichannel system , 2005 .
[3] Xiaoming Huo,et al. Near-optimal detection of geometric objects by fast multiscale methods , 2005, IEEE Transactions on Information Theory.
[4] A. Nobel,et al. Finding large average submatrices in high dimensional data , 2009, 0905.1682.
[5] P. Bickel,et al. SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR , 2008, 0801.1095.
[6] V. Koltchinskii,et al. Nuclear norm penalization and optimal rates for noisy low rank matrix completion , 2010, 1011.6256.
[7] Luc Devroye,et al. Combinatorial Testing Problems , 2009, 0908.3437.
[8] E. Candès,et al. Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism , 2010, 1007.1434.
[9] E. Candès,et al. Detection of an anomalous cluster in a network , 2010, 1001.3209.
[10] A. Nobel,et al. On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix. , 2010, Bernoulli : official journal of the Bernoulli Society for Mathematical Statistics and Probability.