Minimax localization of structural information in large noisy matrices

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Kolar, Mladen ^a   Balakrishnan, Sivaraman ^a   Rinaldo, Alessandro ^b   Singh, Aarti ^a  

^a Carnegie Mellon University   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RELAXATION PROCESSES; STATISTICAL TESTS;

BI CLUSTERS; BICLUSTERING; DATA MATRIX; LARGE DATA; LOCALISATION; MINIMAX; NOISY MATRIX; SPARSE SET; STRUCTURAL INFORMATION; THRESHOLDING;

SIGNAL TO NOISE RATIO;

EID: 85162478941     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. Louigi Addario-Berry, Nicolas Broutin, Luc Devroye, and Gábor Lugosi. On combinatorial testing problems. Ann. Statist., 38(5):3063-3092, 2010.
2. A.A. Amini and M.J. Wainwright. High-Dimensional Analysis Of Semidefinite Relaxations For Sparse Principal Components. The Annals of Statistics, 37(5B):2877-2921, 2009.
3. Ery Arias-Castro, Emmanuel J. Candès, and Arnaud Durand. Detection of an anomalous cluster in a network. Ann. Stat., 39(1):278-304, 2011.
4. Ery Arias-Castro, Emmanuel J. Candès, Hannes Helgason, and Ofer Zeitouni. Searching for a trail of evidence in a maze. Ann. Statist., 36(4):1726-1757, 2008.
5. Ery Arias-Castro, David L. Donoho, and Xiaoming Huo. Adaptive multiscale detection of filamentary structures in a background of uniform random points. Ann. Statist., 34(1):326-349, 2006.
6. Jushan Bai. Inferential theory for factor models of large dimensions. Econometrica, 71(1):pp. 135-171, 2003.
7. Ulrich Bayer, Paolo Milani Comparetti, Clemens Hlauscheck, Christopher Kruegel, and Engin Kirda. Scalable, Behavior-Based Malware Clustering. In 16th Symposium on Network and Distributed System Security (NDSS), 2009.
8. F. Benaych-Georges and R. Rao Nadakuditi. The singular values and vectors of low rank perturbations of large rectangular random matrices. ArXiv e-prints, March 2011.
9. S. Busygin, O. Prokopyev, and P.M. Pardalos. Biclustering in data mining. Computers & Operations Research, 35(9):2964-2987, 2008.
10. Emmanuel J. Candès, Xiaodong Li, Yi Ma, and John Wright. Robust principal component analysis? CoRR, abs/0912.3599, 2009.
11. Alexandre d'Aspremont, Laurent El Ghaoui, Michael I. Jordan, and Gert R. G. Lanckriet. A direct formulation for sparse pca using semidefinite programming. SIAM Review, 49:434-448, 2007.
12. K.R. Davidson and S.J. Szarek. Local operator theory, random matrices and Banach spaces. Handbook of the geometry of Banach spaces, 1:317-366, 2001.
13. R. Fletcher. Semi-definite matrix constraints in optimization. SIAM Journal on Control and Optimization, 23:493, 1985.
14. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):pp. 123-129, 1972.
15. I.M. Johnstone. On the distribution of the largest eigenvalue in principal components analysis. The Annals of Statistics, 29(2):295-327, 2001.
16. I.M. Johnstone and A.Y. Lu. On consistency and sparsity for principal components analysis in high dimensions. Journal of the American Statistical Association, 104(486):682-693, 2009.
17. L. Lazzeroni and A. Owen. Plaid models for gene expression data. Statistica sinica, 12:61-86, 2002.
18. Mihee Lee, Haipeng Shen, Jianhua Z. Huang, and J. S. Marron. Biclustering via sparse singular value decomposition. Biometrics, 66(4):1087-1095, 2010.
19. Jinze Liu and Wei Wang. Op-cluster: Clustering by tendency in high dimensional space. In Proceedings of the Third IEEE International Conference on Data Mining, ICDM '03, pages 187-, Washington, DC, USA, 2003. IEEE Computer Society.
20. S.C. Madeira and A.L. Oliveira. Biclustering algorithms for biological data analysis: a survey. IEEE Transactions on computational Biology and Bioinformatics, pages 24-45, 2004.
21. A. Onatski. Asymptotics of the principal components estimator of large factor models with weak factors. Economics Department, Columbia University, 2009.
22. L. Parsons, E. Haque, and H. Liu. Subspace clustering for high dimensional data: a review. ACM SIGKDD Explorations Newsletter, 6(1):90-105, 2004.
23. R.T. Rockafellar. The theory of subgradients and its applications to problems of optimization. Convex and nonconvex functions. Heldermann, 1981.
24. H. Shen and J.Z. Huang. Sparse principal component analysis via regularized low rank matrix approximation. Journal of multivariate analysis, 99(6):1015-1034, 2008.
25. GW Stewart. Perturbation theory for the singular value decomposition. Computer Science Technical Report Series; Vol. CS-TR-2539, page 13, 1990.
26. X. Sun and A. B. Nobel. On the maximal size of Large-Average and ANOVA-fit Submatrices in a Gaussian Random Matrix. ArXiv e-prints, September 2010.
27. A. Tanay, R. Sharan, and R. Shamir. Biclustering algorithms: A survey. Handbook of computational molecular biology, 2004.
28. A.B. Tsybakov. Introduction to nonparametric estimation. Springer, 2009.
29. Lyle Ungar and Dean P. Foster. A formal statistical approach to collaborative filtering. In CONALD, 98.
30. S. Wang, R. R. Gutell, and D. P. Miranker. Biclustering as a method for RNA local multiple sequence alignment. Bioinformatics, 23:3289-3296, Dec 2007.
31. D.M.Witten, R. Tibshirani, and T. Hastie. A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis. Biostatistics, 10(3):515, 2009.
32. H. Zou, T. Hastie, and R. Tibshirani. Sparse principal component analysis. Journal of computational and graphical statistics, 15(2):265-286, 2006.