A learning algorithm with gaussian regularizer for kernel neuron

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In support vector machine there exist four attractive techniques: kernel idea to construct nonlinear algorithm using Mercer kernels, large margin or regularization to control generalization ability, convex objective functional to obtain unique solution, and support vectors or sparseness to reduce computation time. The kernel neuron is the nonlinear version of McCulloch-Pitts neuron based on kernels. In this paper we define a regularized risk functional including empirical risk functional and Gaussian regularizer for kernel neuron. On the basis of gradient descent method, single sample correction and momentum term, the corresponding learning algorithm is designed, which can realize four ideas in support vector machine with a simple iterative scheme and can handle the classification and regression problems effectively. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Xu, J., & Zhang, X. (2004). A learning algorithm with gaussian regularizer for kernel neuron. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3173, 252–257. https://doi.org/10.1007/978-3-540-28647-9_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free