R1-PCA: Rotational invariant L1-norm principal component analysis for robust subspace factorization

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 281-288

  Ding, Chris ^a   Zhou, Ding ^b   He, Xiaofeng ^a   Zha, Hongyuan ^b  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b The Center for Nanotechnology Education and Utilization   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ROBUST COVARIANCE MATRIX; ROBUST SUBSPACE FACTORIZATION; ROTATIONAL INVARIANT; SQUARED ERRORS;

ALGORITHMS; CLUSTER ANALYSIS; COVARIANCE MATRIX; DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; PRINCIPAL COMPONENT ANALYSIS;

FACTORIZATION;

EID: 34250776571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143880     Document Type: Conference Paper

References (12)

1. Aanas, H., Fisker, R., Astrm, K., &: Carstensen, J. (2002). Robust factorization. IEEE. Trans. on Pattern Analysis and Machine Intelligence, 24, 1215-1225.
2. d'Aspremont, A., Ghaoui, L. E., Jordan, M., & Lanckriet, G. (2004). A direct formulation for sparse pea using semidefinite programming. UC Berkeley Tech Report.
3. Ding, C., & He, X. (2004). K-means clustering and principal component analysis. Int'l Conf. Machine Learning.
4. Golub, G., & Van Loan, C. (1996). Matrix computations, 3rd edition. Johns Hopkins, Baltimore.
5. Jolliffe, I. (2002). Principal component analysis. Springer. 2nd edition.
6. Ke, Q., & Kanade, T. (2004). Robust LI norm factorization in the presence of outliers and missing data by alternative convex programming. IEEE Conf. Computer Vision and Pattern Recognition (pp. 592-599).
7. Ng, A. (2004). Feature selection, L1 vs. L2 regularization, and rotational invariance. Proc. Int'l Conf. Machine Learning.
8. Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. J. Royal Statist. Soc B., 58, 267-288.
9. Torre, F. D., & Black, M. J. (2003). A framework for robust subspace learning. Int'l J. Computer Vision, 117-142.
10. Zha, H., Ding, C., Gu, M., He, X., & Simon, H. (2002). Spectral relaxation for K-means clustering. Advances in Neural Information Processing Systems 14 (NIPS'01), 1057-1064.
11. Zhang, Z., Zha, H., &: Simon, H. (2004). Low-rank approximations with sparse factors ii: Penalized methods with discrete newton-like iterations. SIAM J. Matrix Analysis Applications, 901-920.
12. Zou, H., Hastie, T., & Tibshirani, R. (2004). Sparse principal component analysis. Standard Statistics Tech Report.