流形学习中基于曲率预测的自适应邻域选择算法
Adaptive Neighboring Selection Algorithm Based on Curvature Prediction in Manifold Learning
摘要:
近年来,用于降维的流形学习算法受到了越来越多的关注,提出了各种线性和非线性、全局和局部的算法。流形学习算法的关键步骤是邻域选择。然而,到目前为止,我们所知道的参考文献中,很少有提出一个普遍接受的算法来很好地选择相邻区域。因此,本文提出了一种自适应的邻域选择算法,并将LLE和ISOMAP算法成功地应用于测试中。它是一种可以找到流形上数据点的最佳K个最近邻居的算法。该算法的理论基础是流形上数据点的近似曲率。雅克布矩阵是基于黎曼几何的一个恰当的数学概念,可以用来预测曲率的近似值。通过对基于LLE和ISOMAP算法的R3到R2嵌入Swiss roll算法进行验证,仿真结果表明,所提出的自适应邻域选择算法是可行的,能够找到最优K值,使得残差方差相对较小,结果的可视化效果更好。定量分析表明,采用该算法后,以残差方差衡量的嵌入质量提高了45.45%。
英文摘要:
Recently manifold learning algorithm for dimensionality reduction attracts more and more interests, and various linear and nonlinear, global and local algorithms are proposed. The key step of manifold learning algorithm is the neighboring region selection. However, so far for the references we know, few of which propose a generally accepted algorithm to well select the neighboring region. So in this paper, we propose an adaptive neighboring selection algorithm, which successfully applies the LLE and ISOMAP algorithms in the test. It is an algorithm that can find the optimal K nearest neighbors of the data points on the manifold. And the theoretical basis of the algorithm is the approximated curvature of the data point on the manifold. Based on Riemann Geometry, Jacob matrix is a proper mathematical concept to predict the approximated curvature. By verifying the proposed algorithm on embedding Swiss roll from R3 to R2 based on LLE and ISOMAP algorithm, the simulation results show that the proposed adaptive neighboring selection algorithm is feasible and able to find the optimal value of K, making the residual variance relatively small and better visualization of the results. By quantitative analysis, the embedding quality measured by residual variance is increased 45.45% after using the proposed algorithm in LLE.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。