HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Ikeda, K. Search for Related Content PubMed PubMed Citation Articles by Ikeda, K.

An Asymptotic Statistical Theory of Polynomial Kernel Methods

kazushi{at}i.kyoto-u.ac.jp, Graduate School of Informatics, Kyoto University, Sakyo, Kyoto 606-8501, Japan

The generalization properties of learning classifiers with a polynomial kernel function are examined. In kernel methods, input vectors are mapped into a high-dimensional feature space where the mapped vectors are linearly separated. It is well-known that a linear dichotomy has an average generalization error or a learning curve proportional to the dimension of the input space and inversely proportional to the number of given examples in the asymptotic limit. However, it does not hold in the case of kernel methods since the feature vectors lie on a submanifold in the feature space, called the input surface. In this letter, we discuss how the asymptotic average generalization error depends on the relationship between the input surface and the true separating hyperplane in the feature space where the essential dimension of the true separating polynomial, named the class, is important. We show its upper bounds in several cases and confirm these using computer simulations.

This article has been cited by other articles:

				K. Ikeda and N. Murata Geometrical Properties of Nu Support Vector Machines with Different Norms Neural Comput., November 1, 2005; 17(11): 2508 - 2529. [Abstract] [Full Text] [PDF]