基于改进图正则项的自编码器特征学习算法  

Feature learning method based on improved graph regularized auto-encoder

作　　者：吴文彬 周伟[1] 唐东明[1] Wu Wenbin;Zhou Wei;Tang Dongming(School of Computer Science&Engineering,Southwest Minzu University,Chengdu 610041,China)

机构地区：[1]西南民族大学计算机科学与工程学院,成都610041

出　　处：《计算机应用研究》2022年第2期485-490,共6页Application Research of Computers

基　　金：四川省科技计划资助项目(2019YFG0207);西南民族大学2021年研究生“创新型科研项目”(CX2021SZ51)。

摘　　要：传统的图正则化方法使用欧氏距离度量样本空间的相似度,并不能准确考察复杂数据集的邻域信息,容易导致模型在复杂形状数据和非凸数据集中的泛化性能下降。提出一种改进的图正则算法,使用等距特征映射保留样本空间的邻域信息,帮助模型进行流形学习,同时结合使用KL约束进一步使得数据表示的外部结构变得光滑,从而捕获到更稀疏和高级的特征表示。在MNIST和YaleB等数据集上的实验结果表明,相比于流行的几种特征提取算法,该算法能够提取到更有意义和稳健的特征。在分类任务和聚类任务上具有优势,同时具有更好的抗干扰性能。Traditional graph regularization methods use Euclidean distance to measure the similarity of sample space,and can not accurately preserve the neighborhood information of complex data sets,which easily lead to the degradation of the generalization performance of the model in complex shape data and non convex data sets.This paper proposed an improved graph regularization algorithm,which used isometric feature mapping to preserve the neighborhood information of the sample space and help the model learn manifold.The simultaneous used of KL constraints further smoothed the external structure of the data representation,thereby capturing more sparse and advanced feature representations.Experimental results on MNIST and YaleB datasets show that compared with several popular feature extraction algorithms,the proposed algorithm can extract more mea-ningful and robust features.It has advantages in classification and clustering tasks,and also has better anti-interference capability.

关 键 词：特征表示 图正则 流形学习 自编码器 KL散度 鲁棒性 无监督学习 

分 类 号：TP391.1[自动化与计算机技术—计算机应用技术]