BriefGPT.xyz
Dec, 2015
基于动态连续索引的快速K最近邻搜索
Fast k-Nearest Neighbour Search via Dynamic Continuous Indexing
HTML
PDF
Ke Li, Jitendra Malik
TL;DR
提出一种新的无需数据空间分割的随机化算法来避免由于数据维度过高而导致的数据检索问题,并通过理论分析和实验结果来证明这种算法在数据近似性、速度和空间效率等方面优于传统的局部敏感哈希算法(LSH)
Abstract
Existing methods for retrieving
k-nearest neighbours
suffer from the
curse of dimensionality
. We argue this is caused in part by inherent deficiencies of
→