Simple and robust methods for support vector expansions

Most support vector (SV) methods proposed in the recent literature can be viewed in a unified framework with great flexibility in terms of the choice of the kernel functions and their constraints. We show that all these problems can be solved within a unique approach if we are equipped with a robust method for finding a sparse solution of a linear system. Moreover, for such a purpose, we propose an iterative algorithm that can be simply implemented. Finally, we compare the classical SV approach with other, recently proposed, cross-correlation based, alternative methods. The simplicity of their implementation and the possibility of exactly calculating their computational complexity constitute important advantages in a real-time signal processing scenario.

[1]  E. Lorenz.  Deterministic nonperiodic flow , 1963 .

[2]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[3]  Gene H. Golub,et al.  Matrix computations , 1983 .

[4]  F. Girosi,et al.  Networks for approximation and learning , 1990, Proc. IEEE.

[5]  Alan J. Miller,et al.  Subset Selection in Regression , 1991 .

[6]  Alan J. Miller.  Subset Selection in Regression , 1992 .

[7]  Stéphane Mallat,et al.  Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[8]  Shie Qian,et al.  Signal representation using adaptive normalized Gaussian functions , 1994, Signal Process..

[9]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[10]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[11]  Federico Girosi,et al.  An improved training algorithm for support vector machines , 1997, Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop.

[12]  R. C. Williamson,et al.  Support vector regression with automatic accuracy control. , 1998 .

[13]  Paul S. Bradley,et al.  Feature Selection via Concave Minimization and Support Vector Machines , 1998, ICML.

[14]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[15]  Bernhard Schölkopf,et al.  Semiparametric Support Vector and Linear Programming Machines , 1998, NIPS.

[16]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[17]  Thorsten Joachims,et al.  Making large scale SVM learning practical , 1998 .

[18]  Michael A. Saunders,et al.  Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..

[19]  Federico Girosi,et al.  An Equivalence Between Sparse Approximation and Support Vector Machines , 1998, Neural Computation.

[20]  Simon Haykin,et al.  An explicit algorithm for training support vector machines , 1999, IEEE Signal Processing Letters.

[21]  Simon Haykin,et al.  Support vector machines for dynamic reconstruction of a chaotic system , 1999 .

[22]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[23]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.