arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.6594cs.AIcs.LGstat.ML
收藏

高维数据分析的自适应拉普拉斯金字塔

Auto-adaptative Laplacian Pyramids for High-dimensional Data Analysis

UAM(马德里自治大学);Afeka(阿费卡学院)

Ángela Fernández, Neta Rabin, Dalia Fishelov, José R. Dorronsoro

摘要:

诸如流形学习算法的非线性降维技术已经成为用于处理和分析高维模式的常用方式,所述高维模式通常具有与未知函数的值相对应的目标。它们对新点的应用包括两个步骤:首先,将新数据点嵌入到低维空间中,然后,从嵌入空间中的相邻点估计测试点上的函数值。然而,找到测试点的低维表示虽然对于简单但通常不够强大的程序(如PCA)来说很容易,但对于依赖于某种特征分析的方法(如谱聚类(SC)或扩散映射(DM))来说可能要复杂得多。类似地,当要评估目标函数时,如果函数有噪声,则最近邻等平均方法可能会给出不稳定的结果。因此,相对于描述所检查数据的几何结构的内在低维表示的目标函数的平滑是一项具有挑战性的任务。在本文中,我们提出了自适应拉普拉斯金字塔模型(ALP),这是标准拉普拉斯金字塔模型的扩展,它包含了修改后的LOOCV过程,避免了标准过程的巨大成本,并提供了以下优点:(i)它自动选择最佳函数分辨率(停止时间)适合于数据及其噪声,(ii)由于它不需要参数化,因此易于应用,(iii)它不会过拟合训练集,以及(iv)与其他经典插值方法相比,它不会增加额外的成本。我们数值说明ALP的行为的合成问题,并将其应用到计算DM投影的新模式和扩展到他们的目标函数值的辐射预测问题在非常高维的图案。

英文摘要:

Non-linear dimensionality reduction techniques such as manifold learning algorithms have become a common way for processing and analyzing high-dimensional patterns that often have attached a target that corresponds to the value of an unknown function. Their application to new points consists in two steps: first, embedding the new data point into the low dimensional space and then, estimating the function value on the test point from its neighbors in the embedded space. However, finding the low dimension representation of a test point, while easy for simple but often not powerful enough procedures such as PCA, can be much more complicated for methods that rely on some kind of eigenanalysis, such as Spectral Clustering (SC) or Diffusion Maps (DM). Similarly, when a target function is to be evaluated, averaging methods like nearest neighbors may give unstable results if the function is noisy. Thus, the smoothing of the target function with respect to the intrinsic, low-dimensional representation that describes the geometric structure of the examined data is a challenging task. In this paper we propose Auto-adaptive Laplacian Pyramids (ALP), an extension of the standard Laplacian Pyramids model that incorporates a modified LOOCV procedure that avoids the large cost of the standard one and offers the following advantages: (i) it selects automatically the optimal function resolution (stopping time) adapted to the data and its noise, (ii) it is easy to apply as it does not require parameterization, (iii) it does not overfit the training set and (iv) it adds no extra cost compared to other classical interpolation methods. We illustrate numerically ALP's behavior on a synthetic problem and apply it to the computation of the DM projection of new patterns and to the extension to them of target function values on a radiation forecasting problem over very high dimensional patterns.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑