Pang Shaoning, Ozawa Seiichi, Kasabov Nikola
Knowledge Engineering and Discovery Research Institute, Auckland University of Technology, New Zealand.
IEEE Trans Syst Man Cybern B Cybern. 2005 Oct;35(5):905-14. doi: 10.1109/tsmcb.2005.847744.
This paper presents a constructive method for deriving an updated discriminant eigenspace for classification when bursts of data that contains new classes is being added to an initial discriminant eigenspace in the form of random chunks. Basically, we propose an incremental linear discriminant analysis (ILDA) in its two forms: a sequential ILDA and a Chunk ILDA. In experiments, we have tested ILDA using datasets with a small number of classes and small-dimensional features, as well as datasets with a large number of classes and large-dimensional features. We have compared the proposed ILDA against the traditional batch LDA in terms of discriminability, execution time and memory usage with the increasing volume of data addition. The results show that the proposed ILDA 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.
本文提出了一种构造方法,用于在包含新类别的数据突发以随机块的形式添加到初始判别特征空间时,推导用于分类的更新判别特征空间。基本上,我们提出了两种形式的增量线性判别分析(ILDA):顺序ILDA和块ILDA。在实验中,我们使用了具有少量类别和低维特征的数据集以及具有大量类别和高维特征的数据集来测试ILDA。随着数据添加量的增加,我们在可区分性、执行时间和内存使用方面将所提出的ILDA与传统批量LDA进行了比较。结果表明,与其他方法相比,所提出的ILDA能够在快速且大量的数据流上有效地演化判别特征空间,并在分类中提取具有卓越可区分性的特征。