作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (12): 25-27. doi: 10.3969/j.issn.1000-3428.2010.12.009

• 博士论文 • 上一篇    下一篇

基于流形学习的维数约简算法

姜 伟1,2,杨炳儒1   

  1. (1. 北京科技大学信息工程学院,北京 100083;2. 辽宁师范大学数学学院,大连 116029)
  • 出版日期:2010-06-20 发布日期:2010-06-20
  • 作者简介:姜 伟(1969-),男,副教授、博士研究生,主研方向:数据挖掘,流形学习,模式识别;杨炳儒,教授、博士生导师
  • 基金资助:

    国家自然科学基金资助项目“基于大规模复杂结构知识库的知识发现机理、模型与算法研究”(60675030)

Dimensionality Reduction Algorithm Based on Manifold Learning

JIANG Wei1,2, YANG Bing-ru1   

  1. (1. School of Information Engineering, University of Science and Technology Beijing, Beijng 100083;2. School of Mathematics, Liaoning Normal University, Dalian 116029)
  • Online:2010-06-20 Published:2010-06-20

摘要:

介绍线性维数约简的主成分分析和多维尺度算法,描述几种经典的能发现嵌入在高维数据空间的低维光滑流形非线性维数约简算法,包括等距映射、局部线性嵌入、拉普拉斯特征映射、局部切空间排列、最大方差展开。与线性维数约简算法相比,非线性维数约简算法通过维数约简能够发现不同类型非线性高维数据的本质特征。

关键词: 流形学, 谱图理论, 局部切空间, 特征映射

Abstract:

This paper reviews Principal Components Analysis(PCA) and Multidimensional Scaling(MDS) methods for linear dimensionality reduction. Several classical nonlinear dimensional reduction methods that can find a smooth low-dimensional manifold embedded in the high-dimensional space are described and a number of improvement of these algorithms are introduced, including Isometric Feature Mapping (ISOMAP), Locally Linear Embedding(LLE), Laplacian Eigenmaps, Local Tangent Space Alignment(LTSA), Maximum Variance Unfolding (MVU). Compared with linear methods, nonlinear dimensionality reduction methods in manifold can extract the intrinsic characteristics of different types of high-dimensional data performing nonlinear dimensionality reduction.

Key words: manifold learning, spectral graph theory, local tangent space, eigenmaps

中图分类号: