Learning the kernel matrix by maximizing a KFD-based class separability criterion

Dit‐Yan Yeung

doi:10.1016/j.patcog.2006.12.031

Return

Learning the kernel matrix by maximizing a KFD-based class separability criterion

2007-07-01

Dit‐Yan Yeung *

常虹 (Hong Chang)

Guang Dai

DOI：10.1016/j.patcog.2006.12.031

Original

Save

View PDF

Abstract

En 中文

The advantage of a kernel method often depends critically on a proper choice of the kernel function. A promising approach is to learn the kernel from data automatically. In this paper, we propose a novel method for learning the kernel matrix based on maximizing a class separability criterion that is similar to those used by linear discriminant analysis (LDA) and kernel Fisher discriminant (KFD). It is interesting to note that optimizing this criterion function does not require inverting the possibly singular within-class scatter matrix which is a computational problem encountered by many LDA and KFD methods. We have conducted experiments on both synthetic data and real-world data from UCI and FERET, showing that our method consistently outperforms some previous kernel learning methods. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keywords:

kernel learning

Fisher discriminant criterion

kernel fisher discriminant

face recognition

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.