Wiener implementation of kernel machines

  • Authors:
  • Akira Tanaka;Hideyuki Imai;Jun Toyama;Mineichi Kudo;Masaaki Miyakoshi

  • Affiliations:
  • Hokkaido University, Kita-ku, Sapporo, Japan;Hokkaido University, Kita-ku, Sapporo, Japan;Hokkaido University, Kita-ku, Sapporo, Japan;Hokkaido University, Kita-ku, Sapporo, Japan;Hokkaido University, Kita-ku, Sapporo, Japan

  • Venue:
  • SPPRA '08 Proceedings of the Fifth IASTED International Conference on Signal Processing, Pattern Recognition and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Kernel machines are widely known as powerful tools in various fields of information science. One of central topics of kernel machines is a selection of a kernel function or its parameters. In terms of generalization ability, many methods, represented by cross-validation, have been used for the selection. However, the mathematical analyses of the role of the kernels in kernel machines are not investigated sufficiently. The difficulty of the analyses lies on the fact that the metric of the reproducing kernel Hilbert space corresponding to the adopted kernel depends on the kernel itself, which implies that we do not have a unified (or kernel-independent) framework for the formulation of learning problems. In this paper, we construct a unified framework of learning problems and show that the kernel plays a role to specify the correlation structure of an unknown target function to be estimated.