arrow
Return

A fast kernel-based nonlinear discriminant analysis for multi-class problems

delete2006-06-01
delete98
PRE
AI
徐
徐勇 (Yong Xu)
章典 cover
章典 (David Zhang)
Z
Zhong Jin
M
Miao Li
杨敬钰 cover
杨敬钰 (Jingyu Yang)
DOI:10.1016/j.patcog.2005.10.029delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Nonlinear discriminant analysis may be transformed into the form of kernel-based discriminant analysis. Thus, the corresponding discriminant direction can be solved by linear equations. From the view of feature space, the nonlinear discriminant analysis is still a linear method, and it is provable that in feature space the method is equivalent to Fisher discriminant analysis. We consider that one linear combination of parts of training samples, called significant nodes, can replace the total training samples to express the corresponding discriminant vector in feature space to some extent. In this paper, an efficient algorithm is proposed to determine significant nodes one by one. The principle of determining significant nodes is simple and reasonable, and the consequent algorithm can be carried out with acceptable computation cost. Depending on the kernel functions between test samples and all significant nodes, classification can be implemented. The proposed method is called fast kernel-based nonlinear method (FKNM). It is noticeable that the number of significant nodes may be much smaller than that of the total training samples. As a result, for two-class classification problems, the FKNM will be much more efficient than the naive kernel-based nonlinear method (NKNM). The FKNM can be also applied to multi-class via two approaches: one-against-the-rest and one-against-one. Although there is a view that one-against-one is superior to one-against-the-rest in classification efficiency, it seems that for the FKNM one-against-the-rest is more efficient than one-against-one. Experiments on benchmark and real datasets illustrate that, for two-class and multi-class classifications, the FKNM is effective, feasible and much efficient. (c) 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
Fisher discriminant analysis
kernel-based nonlinear discriminant analysis
fast kernel-based nonlinear method
pattern recognition
face recognition
feature extraction
AI Summary

AI Summary

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

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available
Cited Papers

Cited Papers

Nonlinear Component Analysis as a Kernel Eigenvalue Problem
err1998-07-01
err0
errOAAI
errBernhard Schölkopf; Alexander Smola; Klaus-Robert Müller
errShare
errSave
A novel method for Fisher discriminant analysis
err2004-02-01
err87
PREAI
errXu, Y; Yang, JY; Jin, Z
errShare
errSave
A reformative kernel Fisher discriminant analysis
err2004-06-01
err50
PREAI
errXu, Y; Yang, JY; Yang, J
errShare
errSave
Theory analysis on FSLDA and ULDA
err2003-12-01
err47
PREAI
errXu, Y; Yang, JY; Jin, Z
errShare
errSave
researcher View more