This paper presents a constructive method for deriving an updated discriminant eigenspace for classification, when bursts of new classes of data is being added to an initial discriminant eigenspace in the form of random chunks. The proposed Chunk incremental linear discriminant analysis (I-LDA) can effectively evolve a discriminant eigenspace over a fast and large data stream, and extract features with superior discriminability in classification, when compared with other methods. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Pang, S., Ozawa, S., & Kasabov, N. (2005). Chunk incremental LDA computing on data streams. In Lecture Notes in Computer Science (Vol. 3497, pp. 51–56). Springer Verlag. https://doi.org/10.1007/11427445_9
Mendeley helps you to discover research relevant for your work.