An incremental linear discriminant analysis using fixed point method

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Linear Discriminant Analysis (LDA) is a very powerful method in pattern recognition. But it is difficult to realize online processing for data stream. In this paper, a new adaptive LDA method is proposed. We decompose the online LDA problem into two adaptive PCA problems and develop a fixed point adaptive PCA to implement adaptive LDA. Online updating of in-class scatter matrix S w (t) and covariance matrix C x (t) are derived in this paper. Simulation results show that the proposed method has no learning rate, fast convergence and less time-consuming. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Chen, D., & Zhang, L. (2006). An incremental linear discriminant analysis using fixed point method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 1334–1339). Springer Verlag. https://doi.org/10.1007/11759966_198

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free