Updates for nonlinear discriminants

Authors:
Edin Andelic;Martin Schafföner;Marcel Katz;Sven E. Krüger;Andreas Wendemuth
Affiliations:
Cognitive Systems Group, IESK, Otto-von-Guericke-University, Magdeburg, Germany;Cognitive Systems Group, IESK, Otto-von-Guericke-University, Magdeburg, Germany;Cognitive Systems Group, IESK, Otto-von-Guericke-University, Magdeburg, Germany;Cognitive Systems Group, IESK, Otto-von-Guericke-University, Magdeburg, Germany;Cognitive Systems Group, IESK, Otto-von-Guericke-University, Magdeburg, Germany
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 11
Cited 0

Minimizing GCV/GML scores with multiple smoothing parameters via the Newton method

SIAM Journal on Scientific and Statistical Computing
Bayesian interpolation

Neural Computation
Sparse Approximate Solutions to Linear Systems

SIAM Journal on Computing
Least Squares Support Vector Machine Classifiers

Neural Processing Letters
Nonlinear Fisher discriminant analysis using a minimum squared error cost function and the orthogonal least squares algorithm

Neural Networks
Bayesian framework for least-squares support vector machine classifiers, Gaussian processes, and kernel fisher discriminant analysis

Neural Computation
Sparse Greedy Matrix Approximation for Machine Learning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Some greedy learning algorithms for sparse regression and classification with mercer kernels

The Journal of Machine Learning Research
Accurate on-line support vector regression

Neural Computation
Regularization in the selection of radial basis function centers

Neural Computation
Pruning error minimization in least squares support vector machines

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A novel training algorithm for nonlinear discriminants for classification and regression in Reproducing Kernel Hilbert Spaces (RKHSs) is presented. It is shown how the overdetermined linear least squares-problem in the corresponding RKHS may be solved within a greedy forward selection scheme by updating the pseudoinverse in an order-recursive way. The described construction of the pseudoinverse gives rise to an update of the orthogonal decomposition of the reduced Gram matrix in linear time. Regularization in the spirit of Ridge regression may then easily be applied in the orthogonal space. Various experiments for both classification and regression are performed to show the competitiveness of the proposed method.