A sparsity driven kernel machine based on minimizing a generalization error bound

Pattern Recognition

Volumn 42, Issue 11, 2009, Pages 2607-2614

  Peleg, Dori ^a   Meir, Ron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Classification; Generalization error bounds; Sparsity; Statistical learning theory

Indexed keywords

CLASSIFICATION; CLASSIFICATION TIME; DERIVED DATA; ERROR RATE; EXPANSION COEFFICIENTS; GENERALIZATION ERROR BOUNDS; KERNEL CLASSIFIERS; KERNEL MACHINE; LINEAR PROGRAMS; LOSS FUNCTIONS; OBJECTIVE FUNCTIONS; PENALTY FUNCTION; SPARSITY; STATISTICAL LEARNING THEORY; SUPPORT VECTOR; TRAINING ERRORS;

EDUCATION; SUPPORT VECTOR MACHINES;

OPTIMIZATION;

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

References (23)

1. Schölkopf B., and Smola A.J. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond (2002), MIT Press, Cambridge, MA
2. Herbrich R. Learning Kernel Classifiers, Theory and Algorithms. first ed. (2002), MIT Press, Cambridge
3. Steinwart I. Sparseness of support vector machines. The Journal of Machine Learning Research 4 (2003) 1071-1105
4. Gat Y. Adaptive sparseness for supervised learning. Machine Learning 42 (2001) 233-239
5. Jaeger S.A. Generalization bounds and complexities based on sparsity and clustering for convex combinations of functions from random classes. The Journal of Machine Learning Research 6 (2005) 307-340
6. Mangasarian O.L., and Musicant D.R. Complementarity: Applications, Algorithms and Extensions (2001), Kluwer Academic Publishers, Dordrecht
7. Drezet P.M., and Harrison R.F. A new method for sparsity control in support vector classification and regression. Pattern Recognition 34 (2001) 111-125
8. Fung G.M., Mangasarian O.L., and Smola A.J. Minimal kernel classifiers. The Journal of Machine Learning Research 3 (2002) 303-321
9. Figueiredo M. Adaptive sparseness for supervised learning. IEEE Transactions on Pattern Analysis and Machine Intelligence 25 (2003) 1150-1159
10. Nair P.B., Choudhury A., and Keane A.J. Some greedy learning algorithms for sparse regression and classification with mercer kernels. The Journal of Machine Learning Research 3 (2002) 781-801
11. Wu M., Schölkopf B., and Bakir G. A direct method for building sparse kernel learning algorithms. Journal of Machine Learning Research 7 (2006) 603-624
12. R. Collobert, F. Sinz, J. Weston, L. Bottou, Trading convexity for scalability, in: ICML, 2006, pp. 201-208.
13. J. Valyon, G. Horvath, A sparse least squares support vector machine classifier, in: Proceedings IEEE International Joint Conference on Neural Networks, vol. 1, 2004.
14. Tipping M.E. Sparse Bayesian learning and the relevance vector machine. The Journal of Machine Learning Research 1 (2001) 211-244
15. M. Fazel, H. Hindi, S.P. Boyd, Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices, in: Proceedings of the American Control Conference, vol. 3, 2003, pp. 2156-2162.
16. Bertsimas D., and Tsitsiklis J.N. Introduction to Linear Optimization (1997), Athena Scientific
17. Cristianini N., and Shawe-Taylor J. An Introduction to Support Vector Machines (2000), Cambridge university Press, Cambridge
18. Horst R., and Pardalos P.M. Handbook of Global Optimization. first ed. (1995), Kluwer Academic Publishers, Dordrecht
19. Bertsekas D.P. Nonlinear Programming. second ed. (1999), Athena Scientific
20. Vapnik V. Statistical Learning Theory (1998), Wiley Interscience, New York
21. Weston J., Elisseeff A., Schölkopf B., and Tipping M. Use of the zero norm with linear models and kernel methods. The Journal of Machine Learning Research 3 (2003) 1439-1461
22. Boyd S., and Vandenberghe L. Convex Optimization. first ed. (2004), Cambridge University Press, Cambridge
23. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification. second ed. (2000), Cambridge University Press, Cambridge