On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix

Bernoulli

Volumn 19, Issue 1, 2013, Pages 275-294

  Sun, Xing ^a   Nobel, Andrew B ^b  

^a MERCK RESEARCH LABORATORIES   (United States)

^b University of North Carolina at Chapel Hill   (United States)

Author keywords

Analysis of variance; Data mining; Gaussian random matrix; Large average submatrix; Random matrix theory; Second moment method

Indexed keywords

EID: 84883866510     PISSN: 13507265     EISSN: None     Source Type: Journal    
DOI: 10.3150/11-BEJ394     Document Type: Article

References (11)

1. Alon, N. and Naor, A. (2006). Approximating the cut-norm via Grothendieck's inequality. SIAM J. Comput. 35 787-803 (electronic). MR2203567
2. Anderson, G.W., Guionnet, A. and Zeitouni, O. (2010). An Introduction to Random Matrices. Cambridge Studies in Advanced Mathematics 118. Cambridge: Cambridge Univ. Press. MR2760897
3. Bollobás, Band Erdos, P. (1976). Cliques in random graphs. Math. Proc. Cambridge Philos. Soc. 80 419-427. MR0498256
4. Dawande, M., Keskinocak, P., Swaminathan, J.M. and Tayur, S. (2001). On bipartite and multipartite clique problems. J. Algorithms 41 388-403. MR1869258
5. Geman, S. (1980). A limit theorem for the norm of random matrices. Ann. Probab. 8 252-261. MR0566592
6. Koyuturk, M., Szpankowski, W. and Grama, A. (2004). Biclustering gene-feature matrices for statistically significant dense patterns. In Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference 480-484. IEEE Computer Society, Technical Committee on Bioinformatics.
7. Matula, D. (1976). The largest clique size in a random graph. Technical Report CS 7608, Southern Methodist Univ.
8. Paul, D. (2007). Asymptotics of sample eigenstructure for a large dimensional spiked covariance model. Statist. Sinica 17 1617-1642. MR2399865
9. Scheffé, H. (1999). The Analysis of Variance. Wiley Classics Library. New York: Wiley. MR1673563
10. Sun, X. and Nobel, A. (2006). Significance and recovery of block structures in binary matrices with noise. In Proceedings of the 19th Conference on Learning Theory. Lecture Notes in Computer Science 4005 109-122. Berlin: Springer. MR2277922
11. Sun, X. and Nobel, A.B. (2008). On the size and recovery of submatrices of ones in a random binary matrix. J. Mach. Learn. Res. 9 2431-2453. MR2460888