Generalized spectral bounds for sparse LDA

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 641-648

  Moghaddam, Baback ^a   Weiss, Yair ^b   Avidan, Shai ^a  

^a MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CLASSIFICATION (OF INFORMATION); COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; EIGENVALUES AND EIGENFUNCTIONS; LEARNING ALGORITHMS; VARIATIONAL TECHNIQUES;

CONSTRAINED SOLUTION; DISCRETE SPECTRAL FRAMEWORK; INCLUSION PRINCIPLE; VARIATIONAL EIGENVALUE BOUNDS;

PROBLEM SOLVING;

EID: 34250752344     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143925     Document Type: Conference Paper

References (14)

1. Alon et al. (1999). Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon cancer tissues Cell Biology, 96, 6745-6750.
2. Blum, A., & Langley, P. (1997). Selection of relevant features and examples in machine learning. Artificial Intelligence, 97, 245-271.
3. d'Aspremont, A., Ghaoui, L. E., Jordan, M. I., &: Lanckriet, G. R. G. (2004). A direct formulation for sparse PCA using semidefinite programming. Advances in Neural Information Processing Systems 17 (pp. 803-809). MIT Press.
4. Guyon, I., & Elisseeff, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3, 1157-1182.
5. Guyon, I., Weston, J., Barnhill, S., & Vapnik, V. (2002). Gene selection for cancer classification using support vector machines. Machine Learning, 46, 389-422.
6. Horn, R. A., &: Johnson, C. R. (1985). Matrix Analysis. Cambridge, England: Cambridge Press.
7. Ko, C., Lee, J., & Queyranne, M. (1995). An exact algorithm for maximum entropy sampling. Operations Research, 43, 684-691.
8. Kohavi, R., & John, G. (2003). Wrappers for feature subset selection. Artificial Intelligence Journal, 3, 1157-1182.
9. Mika, S., Rätsch, G., & Müller, K.-R. (2001). A mathematical programming approach to the kernel fisher algorithm. Advances in Neural Information Processing Systems 13 (pp. 591-597). MIT Press.
10. Moghaddam, B., Weiss, Y., &: Avidan, S. (2006). Spectral Bounds for Sparse PCA: Exact & Greedy Algorithms. Advances in Neural Information Processing Systems 18 (pp. 915-922). MIT Press.
11. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and Combinatorial Optimization. New York: John Wiley.
12. Somol, P., Pudil, P., & Kittler, J. (2004). Fast branch & bound algorithms for optimal feature selection. IEEE Pattern Analysis and Machine Intelligence, 26, 900-912.
13. Tibshirani, R. (1995). Regression shrinkage and selection via Lasso. Journal of the Royal Statistical Society B, 58, 267-288.
14. Zou, H., Hastie, T., & Tibshirani, R. (2004). Sparse principal component analysis (Technical R.eport). Statistics Department, Stanford University.