Geometry and learning curves of kernel methods with polynomial kernels

descriptionPublicationkeyboard_double_arrow_right Article 12 Apr 2004 English Publisher:WileyJournal:Systems and Computers in Japan, volume 35, pages 41-48 (issn: 0882-1666, eissn: 1520-684X,

Copyright policy )

Authors: Kazushi Ikeda;

doi: 10.1002/scj.10629

Geometry and learning curves of kernel methods with polynomial kernels

- Summary
- Metrics

Abstract

AbstractThe properties of learning machines with polynomial kernel classifiers, such as support vector machines or kernel perceptrons, are examined. We first derive the number of effective examples which are related to generalization error. Next, we analyze the average prediction errors of several algorithms and show these errors do not depend on the apparent dimension of the feature space. This means that what is called the overfitting phenomena do not appear in kernel methods with polynomial kernels. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 41–48, 2004; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10629

Related Organizations

Kyoto University
Japan

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%