Learning linear PCA with convex semi-definite programming

Pattern Recognition

Volumn 40, Issue 10, 2007, Pages 2633-2640

  Tao, Qing ^a,c   Wu, Gao wei ^b   Wang, Jue ^c  

^a Department of Automation and Simulation   (China)

^b INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Margin; Maximal margin algorithm; Principal component analysis; Robustness; Semi definite programming; Statistical learning theory; Support vector machines

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; DATA COMPRESSION; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING; SUPPORT VECTOR MACHINES;

LEARNING LINEAR; MAXIMAL MARGIN ALGORITHM; STATISTICAL LEARNING THEORY;

PRINCIPAL COMPONENT ANALYSIS;

EID: 34249274949     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2007.01.022     Document Type: Article

References (22)

1. Jolliffe I.T. Principal Component Analysis (1986), Springer, New York
2. Diamantaras K.I., and Kung S.Y. Principal Component Neural Networks (1996), Wiley, New York
3. Croux C., and Haesbroeck G. Principal component analysis based on robust estimators of the covariance or correlation matrix: influence functions and efficiencies. Biometrika 87 (2000) 603-618
4. Higuchi I., and Eguchi S. Robust principal component analysis with adaptive selection for tuning parameters. J. Mach. Learn. Res. 5 (2004) 453-471
5. Hastie T., and Stuetzle W. Principal curves. J. Am. Stat. Assoc. 84 406 (1989) 502-516
6. Smola A.J., Mika S., Schölkopf B., and Williamson R.C. Regularized principal manifolds. J. Mach. Learn. Res. 1 (2001) 179-200
7. Vapnik V. The Nature of Statistical Learning Theory (1995), Springer, New York
8. Vapnik V. Statistical Learning Theory (1998), Wiley, New York
9. Schapire R., Freund Y., Bartlett P., and Sun Lee W. Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Stat. 26 5 (1999) 1651-1686
10. Rätsch G. Robust boosting via convex optimization (2001), Ph.D. Thesis, University of Posdam
11. Cristianini N., and Schawe-Taylor J. An Introduction to Support Vector Machines (2000), Cambridge University Press, Cambridge
12. Valiant L.G. A Theory of the Learnable. Commun. ACM 27 11 (1984) 1134-1142
13. Schölkopf B., Smolar A.J., and Muller K.R. Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput. 10 (1998) 1299-1319
14. Suykens J.A.K., Van Gestel T., Vandewalle J., and De Moor B. A support vector machine formulation to PCA analysis and its kernel version. IEEE Trans. Neural Networks 14 2 (2003) 447-450
15. Suykens J.A.K., and Vandewalle J. Least squares support vector machine classifiers. Neural process. Lett. 9 3 (1999) 293-300
16. Kégl B. Principal curves: learning, design, and applications (1999), Ph.D. Thesis, Concordia University
17. Tao Q., Wu G., and Wang J. A new maximum margin algorithm for one-class problems and its boosting implementation. Pattern Recognition 38 7 (2005) 1071-1077
18. Fletcher R. Practical Methods of Optimization. second ed. (1987), Wiley, New York
19. Vandenberghe L., and Boyd S. Semi-definite programming. SIAM Rev. 38 1 (1996) 49-95
20. Overton M. Large-scale optimization of eigenvalues. SIAM J. Optim. 2 1 (1992) 88-120
21. Lanckriet G.R.G., Cristianini N., Bartlett P., et al. Learning the kernel matrix with semi-definite programming. J. Mach. Learn. Res. 5 (2004) 27-72
22. Schölkopf B., Smola A., Williamson R., and New support vector algorithms P.Bartlett. Neural Comput. 12 (2000) 1083-1121