.png){kind=icon}
返回
Maximal Similarity Embedding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.07.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In recent times the dimensionality reduction technique has been widely exploited in pattern recognition and data mining. The global linear algorithms characterize the local sampling information, thereby making it superior to Principal Component Analysis (PCA). However, these algorithms are all inefficient for extracting the local data feature, which leads to incomplete learning. A new global linear algorithm is proposed in this paper, which is named Maximal Similarity Embedding (MSE). The preserving local feature of this new algorithm makes it distinct from most other methods. The MSE algorithm utilizes the Cosine Metric to describe the geometric characteristics of neighborhood and thus seeks to maximize the global similarity for dimensionality reduction. This new proposal method is robust for sparse dataset and naturally helps in avoiding the problem of small sample size cases. Extensive experiments have been performed on both synthetic and real-world images to prove the efficiency of the MSE algorithm. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Principal Component Analysis
Local tangent space
Similarity embedding
Cosine metric
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A detailed investigation into low-level feature detection in spectrogram images对频谱图图像中低级别特征检测的详细研究.png)
PATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏分享收藏Principal manifolds and nonlinear dimensionality reduction via tangent space alignment基于切线空间对齐的主流形和非线性降维
OAAI
OAAI分享收藏分享收藏
查看更多内容