Learning by local kernel polarization

  • Authors:
  • Tinghua Wang;Shengfeng Tian;Houkuan Huang;Dayong Deng

  • Affiliations:
  • School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, PR China and School of Mathematics and Computer Science, Gannan Normal University, Ganzhou 341000, PR Ch ...;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, PR China;School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, PR China;School of Mathematics and Information Engineering, Zhejiang Normal University, Jinhua 321004, PR China

  • Venue:
  • Neurocomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

The problem of evaluating the quality of a kernel function for a classification task is considered. Drawn from physics, kernel polarization was introduced as an effective measure for selecting kernel parameters, which was previously done mostly by exhaustive search. However, it only takes between-class separability into account but neglects the preservation of within-class local structure. The 'globality' of the kernel polarization may leave less degree of freedom for increasing separability. In this paper, we propose a new quality measure called local kernel polarization, which is a localized variant of kernel polarization. Local kernel polarization can preserve the local structure of the data of the same class so the data can be embedded more appropriately. This quality measure is demonstrated with some UCI machine learning benchmark examples.