首页 | 本学科首页   官方微博 | 高级检索  
     

基于流形学习的维数约简算法
引用本文:姜伟,杨炳儒.基于流形学习的维数约简算法[J].计算机工程,2010,36(12):25-27.
作者姓名:姜伟  杨炳儒
作者单位:1. 北京科技大学信息工程学院,北京,100083;辽宁师范大学数学学院,大连,116029
2. 北京科技大学信息工程学院,北京,100083
基金项目:国家自然科学基金资助项目“基于大规模复杂结构知识库的知识发现机理、模型与算法研究”(60675030)
摘    要:介绍线性维数约简的主成分分析和多维尺度算法,描述几种经典的能发现嵌入在高维数据空间的低维光滑流形非线性维数约简算法,包括等距映射、局部线性嵌入、拉普拉斯特征映射、局部切空间排列、最大方差展开。与线性维数约简算法相比,非线性维数约简算法通过维数约简能够发现不同类型非线性高维数据的本质特征。

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

Dimensionality Reduction Algorithm Based on Manifold Learning
JIANG Wei,YANG Bing-ru.Dimensionality Reduction Algorithm Based on Manifold Learning[J].Computer Engineering,2010,36(12):25-27.
Authors:JIANG Wei  YANG Bing-ru
Affiliation:(1. School of Information Engineering, University of Science and Technology Beijing, Beijng 100083;2. School of Mathematics, Liaoning Normal University, Dalian 116029)
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.
Keywords:manifold learning  spectral graph theory  local tangent space  eigenmaps
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号