The LLE and a linear mapping
文献类型:期刊论文
| 作者 | Wu, F. C. ; Hu, Z. Y.
|
| 刊名 | PATTERN RECOGNITION
![]() |
| 出版日期 | 2006-09-01 |
| 卷号 | 39期号:9页码:1799-1804 |
| 关键词 | locally linear embedding (LLE) linear mapping principal component analysis (PCA) |
| 英文摘要 | The locally linear embedding (LLE) is considered an effective algorithm for dimensionality reduction. In this short note, some of its key properties are studied. In particular, we show that: (1) there always exists a linear mapping from the high-dimensional space to the low-dimensional space such that all the constraint conditions in the LLE can be satisfied. The implication of the existence of such a linear mapping is that the LLE cannot guarantee a one-to-one mapping from the high-dimensional space to the low-dimensional space for a given data set: (2) if the LLE is required to globally preserve distance, it must be a PCA mapping; (3) for a given high-dimensional data set, there always exists a local distance-preserving LLE. The above results can bring some new insights into a better understanding of the LLE. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved. |
| WOS标题词 | Science & Technology ; Technology |
| 类目[WOS] | Computer Science, Artificial Intelligence ; Engineering, Electrical & Electronic |
| 研究领域[WOS] | Computer Science ; Engineering |
| 关键词[WOS] | NONLINEAR DIMENSIONALITY REDUCTION |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000239050200020 |
| 公开日期 | 2015-12-24 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/9201] ![]() |
| 专题 | 自动化研究所_09年以前成果 |
| 作者单位 | Chinese Acad Sci, Inst Automat, Natl Lab Pattern Recognit, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wu, F. C.,Hu, Z. Y.. The LLE and a linear mapping[J]. PATTERN RECOGNITION,2006,39(9):1799-1804. |
| APA | Wu, F. C.,&Hu, Z. Y..(2006).The LLE and a linear mapping.PATTERN RECOGNITION,39(9),1799-1804. |
| MLA | Wu, F. C.,et al."The LLE and a linear mapping".PATTERN RECOGNITION 39.9(2006):1799-1804. |
入库方式: OAI收割
来源:自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


