Model selection using a class of kernels with an invariant metric

  • Authors:
  • Akira Tanaka;Masashi Sugiyama;Hideyuki Imai;Mineichi Kudo;Masaaki Miyakoshi

  • Affiliations:
  • Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Department of Computer Science, Tokyo Institute of Technology, Tokyo, Japan;Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;Division of Computer Science, Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan

  • Venue:
  • SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Learning based on kernel machines is widely known as a powerful tool for various fields of information science such as pattern recognition and regression estimation. The efficacy of the model in kernel machines depends on the distance between the unknown true function and the linear subspace, specified by the training data set, of the reproducing kernel Hilbert space corresponding to an adopted kernel. In this paper, we propose a framework for the model selection of kernel-based learning machines, incorporating a class of kernels with an invariant metric.