基于协方差四叉树的各向异性k-近邻搜索
Anisotropic k-Nearest Neighbor Search Using Covariance Quadtree
摘要:
我们提出了一个变种的超四叉树,划分多维空间根据超平面相关联的数据在每个超象限的主要成分。每个$2^λ$超象限是$λ$维子空间中的数据分区,其固有维度$λ\leq d$通过主成分分析从根维度$d$降低,主成分分析丢弃局部协方差矩阵的不相关特征值。在本方法中,如果分量的长度小于局部数据间间距或与局部数据间间距相当,则分量是不相关的。因此,协方差超四叉树完全适应于局部维度。建议的数据结构是用来计算各向异性K近邻(kNN),支持的马氏度量。作为一个应用,我们使用目前的k近邻方法进行噪声数据分布的密度估计。这种估计方法可以进一步结合到光滑粒子流体动力学,允许各向异性流体流动的计算机模拟。
英文摘要:
We present a variant of the hyper-quadtree that divides a multidimensional space according to the hyperplanes associated to the principal components of the data in each hyperquadrant. Each of the $2^λ$ hyper-quadrants is a data partition in a $λ$-dimension subspace, whose intrinsic dimensionality $λ\leq d$ is reduced from the root dimensionality $d$ by the principal components analysis, which discards the irrelevant eigenvalues of the local covariance matrix. In the present method a component is irrelevant if its length is smaller than, or comparable to, the local inter-data spacing. Thus, the covariance hyper-quadtree is fully adaptive to the local dimensionality. The proposed data-structure is used to compute the anisotropic K nearest neighbors (kNN), supported by the Mahalanobis metric. As an application, we used the present k nearest neighbors method to perform density estimation over a noisy data distribution. Such estimation method can be further incorporated to the smoothed particle hydrodynamics, allowing computer simulations of anisotropic fluid flows.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。