.png){kind=icon}
返回
Distinguishing variance embedding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2009.11.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nonlinear dimensionality reduction is a challenging problem encountered in a variety of high dimensional data analysis. Based on the different geometric intuitions of manifolds, maximum variance unfolding (MVU) and Laplacian eigenmaps are designed for detecting the different aspects of data set. In this paper, combining the ideas of MVU and Laplacian eigenmaps, we propose a new nonlinear dimensionality reduction method called distinguishing variance embedding (DVE), which unfolds the data manifold by maximizing the global variance subject to the proximity relation preservation constraint originated in Laplacian eigenmaps. We illustrate the algorithm on easily visualized examples of curves and surfaces, as well as on actual images of faces, handwritten digits, and rotating objects. (C) 2009 Elsevier B.V. All rights reserved.
Keyword:
Manifold learning
Dimensionality reduction
Maximum variance unfolding
Laplacian eigenmaps
Variance analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
引用论文
Principal manifolds and nonlinear dimensionality reduction via tangent space alignment基于切线空间对齐的主流形和非线性降维
OAAI
OAAI分享收藏A Review of Technical Impact of Electrical Vehicle Charging Stations on Distribution Grid电动汽车充电站对配电网的技术影响研究综述
PREAI
分享收藏The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem.png)
SIAM REVIEWOAAI
SIAM REVIEWIF6.1
OAAI分享收藏
查看更多内容