Bilateral random projections

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 1286-1290

  Zhou, Tianyi ^a   Tao, Dacheng ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DENSE MATRICES; LOW RANK APPROXIMATIONS; RANDOM PROJECTIONS; REAL DATA SETS;

INFORMATION THEORY;

EID: 84867564251     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283064     Document Type: Conference Paper

References (7)

1. N. Halko, P. G. Martinsson, and J. A. Tropp, "Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions," arXiv: 0909.4061, 2009.
2. A. Deshpande and S. Vempala, "Adaptive sampling and fast low-rank matrix approximation," in RANDOM '06: The 10th International Workshop on Randomization and Computation, 2006, pp. 292-303.
3. K. L. Clarkson and D. P. Woodruff, "Numerical linear algebra in the streaming model," in Proceedings of the 41st annual ACM symposium on Theory of computing, 2009.
4. M. Fazel, E. J. Candès, B. Recht, and P. Parrilo, "Compressed sensing and robust recovery of low rank matrices," in 42nd Asilomar Conference on Signals, Systems and Computers, 2008.
5. S. Roweis, "Em algorithms for pca and spca," in NIPS, 1998, pp. 626-632.
6. R. J. Muirhead, Aspects of multivariate statistical theory. New York: John Wiley & Sons Inc., 1982.
7. P. J. Phillips, H. Moon, S. A. Rizvi, and P. J. Rauss, "The feret evaluation methodology for face-recognition algorithms," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, no. 10, pp. 1090-1104, 2000.