Name
Abstract | ||
|---|---|---|
Manifold learning algorithms are nonlinear dimensionality reduction methods which could find the intrinsic geometry structure of the data points and recover the latent main factors that influence object changes. However, noise is unavoidable for datasets in the process of sampling. The noisy data easily get wrong results when using manifold learning algorithms. This paper proposes a noisy-data pre-processing method for manifold learning algorithms. Firstly, we utilize shrink strategy and adopt the eigenvalue linear criterion to find the tangent hyperplane of each data point. Then, we construct the local coordinate system for each tangent hyperplane and get the projection coordinates of each data point. Finally, we reconstruct the high-dimensional coordinates of each data point by affine transformation. The experiments show that the proposed method is effective and useful. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-981-10-6373-2_20 | Communications in Computer and Information Science |
Keywords | DocType | Volume |
Noisy data,Manifold learning,Tangent space | Conference | 762 |
ISSN | Citations | PageRank |
1865-0929 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhonghua Hao | 1 | 2 | 2.41 |
| Jingjing Liu | 2 | 515 | 39.31 |
| Shiwei Ma | 3 | 136 | 21.79 |
| Xin Jin | 4 | 333 | 62.83 |
| Xin Lian | 5 | 1 | 0.72 |