Full regularization path for sparse principal component analysis

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 177-184

  D'Aspremont, Alexandre ^a   Bach, Francis R ^b   Ghaoui, Laurent El ^c  

^a PRINCETON UNIVERSITY   (United States)

^b PSL RESEARCH UNIVERSITY   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COVARIANCE MATRIX; MEDICAL COMPUTING; OPTIMIZATION; PROBLEM SOLVING;

LINEAR COMBINATION; SEMIDEFINITE RELAXATION;

PRINCIPAL COMPONENT ANALYSIS;

EID: 34547968748     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273519     Document Type: Conference Paper

References (16)

1. Alizadeh, A., Eisen, M., Davis, R., Ma, C., Lossos, I., & Rosenwald, A. (2000). Distinct types of diffuse large b-cell lymphoma identified by gene expression profiling. Nature, 403, 503-511.
2. Alon, A., Barkai, N., Notterman, D. A., Gish, K., Ybarra, S., Mack, D., & Levine, A. J. (1999). Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays. Cell Biology, 96, 6745-6750.
3. Burer, S., & Monteiro, R. (2003). A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming, 95, 329-357.
4. Cadima, J., & Jolliffe, I. T. (1995). Loadings and correlations in the interpretation of principal components. Journal of Applied Statistics, 22, 203-214.
5. d'Aspremont, A., El Ghaoui, L., Jordan, M., & Lanckriet, G. R. G. (2004). A direct formulation for sparse PCA using semidefinite programming. To appear in SIAM Review.
6. El Ghaoui, L. (2006). On the quality of a semidefinite programming bound for sparse principal component analysis. ArXiV math.OC/0601448.
7. Jolliffe, I. T. (1995). Rotation of principal components: choice of normalization constraints. Journal of Applied Statistics, 22, 29-35.
8. Jolliffe, I. T., Trendafilov, N., & Uddin, M. (2003). A modified principal component technique based on the LASSO. Journal of Computational and Graphical Statistics, 12, 531-547.
9. Kolda, T. G., & O'Leary, D. P. (2000). Algorithm 805: computation and uses of the semidiscrete matrix decomposition. A CM Transactions on Mathematical Software, 26, 415-435.
10. Moghaddam, B., Weiss, Y., & Avidan, S. (2006a). Generalized spectral bounds for sparse LDA. Proc. ICML.
11. Moghaddam, B., Weiss, Y., & Avidan, S. (2006b). Spectral bounds for sparse PCA: Exact and greedy algorithms. Advances in Neural Information Processing Systems, 18.
12. Natarajan, B. K. (1995). Sparse approximate solutions to linear systems. SIAM J. Comput., 24, 227-234.
13. Su, Y., Murali, T. M., Pavlovic, V., Schaffer, M., & Kasif, S. (2003). Rankgene: identification of diagnostic genes based on expression data. Bioinformatics, 19, 1578-1579.
14. Tibshirani, R. (1996). Regression shrinkage and selection via the LASSO. Journal of the Royal statistical society, series B, 58, 267-288.
15. Ton, K. C., Todd, M. J., & Tutuncu, R. H. (1999). SDPT3 - a MATLAB software package for semidefinite programming. Optimization Methods and Software, 11, 545-581.
16. Zou, H., Hastie, T., & Tibshirani, R. (2004). Sparse principal component analysis. Journal of Computational and Graphical Statistics.