计算机科学 ›› 2012, Vol. 39 ›› Issue (Z11): 154-158.

• 软件工程 • 上一篇    下一篇

一种增量式类内局部保持降维算法

王万良,陈星昊,郑建炜,黄琼芳   

  1. (浙江工业大学计算机学院 杭州310023)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Incremental Within-class Locality Preserving Dimension Reduction Algorithm

  • Online:2018-11-16 Published:2018-11-16

摘要: 针对在线学习中的算法效率问题,提出了一种增量式类内局部保持降维算法。该算法综合考虑了基于QR分解的降维算法与保类内Fisher判别分析法的优点,根据训练过程中新增的样本进行投影矩阵在线更新,克服了传统的批量式训练方法在线学习时计算量过分冗余的缺陷。同时,通过兼顾输入样本的局部结构和全局分布状态,使得该算法能够有效地应用于多簇、重叠的数据形态。在()RI、人脸库和COIL20图像库上的实验表明,该增量式算法不仅在降维效果上基本与批量式算法保持一致,而且具有较大的效率优势。

关键词: 在线学习,局部保持,特征降维

Abstract: The original batch learning method contains redundant computation on the issue of on-line learning. To improve the learning efficiency, an incremental within-class locality preserving dimension reduction algorithm is proposed in this literature. This algorithm updates the projection matrix immediately after combing the advantages of a dimension reduction algorithm via QR decomposition and the local within-class features preservation kernel fisher discriminant algorithm. At the same time, this algorithm is effective on the data which is multimode or overlapping by considering the local structure and global distribution of the input samples. The experiments on ORL data set and COIL20 data set show this algorithm has a comparative dimension reduction performance with the batch method and a more fast speed.

Key words: On-line learning, Local features preservation, Dimension reduction

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!