计算机应用 ›› 2012, Vol. 32 ›› Issue (04): 1017-1021.DOI: 10.3724/SP.J.1087.2012.01017

• 人工智能 • 上一篇    下一篇

稀疏判别分析

陈小冬1,林焕祥2   

  1. 1. 浙江广播电视大学 信息与工程学院,杭州 310030
    2. 浙江科技学院 信息与电子工程学院,杭州 310023
  • 收稿日期:2011-09-13 修回日期:2011-11-12 发布日期:2012-04-20 出版日期:2012-04-01
  • 通讯作者: 陈小冬
  • 作者简介:陈小冬(1978-),女,浙江温州人,讲师,硕士,主要研究方向:模式识别、神经计算;
    林焕祥(1975-),男,浙江温州人,讲师,硕士,主要研究方向:模式识别、神经计算。
  • 基金资助:
    浙江省自然科学基金资助项目;浙江省教育厅2011年度科研计划项目;中央广播电视大学资助项目;浙江广播电视大学资助项目;2010年浙江省高校优秀青年教师资助计划项目

Sparse discriminant analysis

CHEN Xiao-dong1,LIN Huan-xiang2   

  1. 1. School of Information and Engineering, Zhejiang Radio and Television University, Hangzhou Zhejiang 310030, China
    2. School of Information and Electronic Engineering,Zhejiang University of Science and Technology, Hangzhou Zhejiang 310023, China
  • Received:2011-09-13 Revised:2011-11-12 Online:2012-04-20 Published:2012-04-01
  • Contact: CHEN Xiao-dong

摘要: 针对流形嵌入降维方法中在高维空间构建近邻图无益于后续工作,以及不容易给近邻大小和热核参数赋合适值的问题,提出一种稀疏判别分析算法(SEDA)。首先使用稀疏表示构建稀疏图保持数据的全局信息和几何结构,以克服流形嵌入方法的不足;其次,将稀疏保持作为正则化项使用Fisher判别准则,能够得到最优的投影。在一组高维数据集上的实验结果表明,SEDA是非常有效的半监督降维方法。

关键词: 判别分析, 稀疏表示, 近邻图, 稀疏图

Abstract: Methods for manifold embedding have the following issues: on one hand, neighborhood graph is constructed in such high-dimensionality of original space that it tends to work poorly; on the other hand, appropriate values for the neighborhood size and heat kernel parameter involved in graph construction are generally difficult to be assigned. To address these problems, a new semi-supervised dimensionality reduction algorithm called SparsE Discriminant Analysis (SEDA) was proposed. Firstly, SEDA set up a sparse graph to preserve the global information and geometric structure of the data based on sparse representation. Secondly, it applied both sparse graph and Fisher criterion to seek the optimal projection. The experimental results on a broad range of data sets show that SEDA is superior to many popular dimensionality reduction methods.

Key words: discriminant analysis, sparse representation, neighborhood graph, sparse graph