An incremental learning algorithm of recursive Fisher linear discriminant

Authors:
Ryohei Ohta;Seiichi Ozawa
Affiliations:
Graduate School of Engineering, Kobe University, Kobe, Japan;Graduate School of Engineering, Kobe University, Kobe, Japan
Venue:
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Year:
2009

Citing 7
Cited 0

Candid Covariance-Free Incremental Principal Component Analysis

IEEE Transactions on Pattern Analysis and Machine Intelligence
IDR/QR: An Incremental Dimension Reduction Algorithm via QR Decomposition

IEEE Transactions on Knowledge and Data Engineering
Incremental linear discriminant analysis for classification of data streams

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Incremental Linear Discriminant Analysis for Face Recognition

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Face recognition using recursive Fisher linear discriminant

IEEE Transactions on Image Processing
Algorithms for accelerated convergence of adaptive PCA

IEEE Transactions on Neural Networks
Incremental Learning of Chunk Data for Online Pattern Classification Systems

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an online feature extraction method called Incremental Recursive Fisher Linear Discriminant (IRFLD) whose batch learning algorithm called RFLD has been proposed by Xiang et al. In the conventional Linear Discriminant Analysis (LDA), the number of discriminant vectors is limited to the number of classes minus one due to the rank of the between-class scatter matrix. RFLD and the proposed IRFLD can eliminate this limitation. In the proposed IRFLD, the Pang et al.'s Incremental Linear Discriminant Analysis (ILDA) is extended such that effective discriminant vectors are recursively searched for the complementary space of a conventional ILDA subspace. In addition, to estimate a suitable number of effective discriminant vectors, we also propose a convergence criterion for the recursive computations which is defined by using the class separability of discriminant features projected on the complementary subspace. The experimental results suggest that the recognition accuracies of IRFLD is improved as the learning proceeds. For several datasets, we confirm that the proposed IRFLD outperforms ILDA in terms of the recognition accuracy. However, the advantage of IRFLD against ILDA depends on datasets.