arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.07679cs.IRcs.DS
收藏

基于排序的快速精确固定半径近邻搜索

Fast and exact fixed-radius neighbor search based on sorting

Xinye Chen, Stefan Güttel

AI总结:

针对现有固定半径近邻近似搜索索引计算重、需调参的问题,提出基于第一主成分排序结合BLAS实现的精确SNN方法,在索引与查询速度上优于暴力法和树方法,且无需调参。

摘要:

固定半径近邻搜索是一种基础数据操作,用于检索查询点周围用户指定距离内的所有数据点。现有可提供快速近似查询响应的高效算法,但其索引阶段计算量极大,且需要精细的参数调优。因此,精确暴力搜索法和基于树的搜索方法仍被广泛使用。本文提出一种名为SNN的新型固定半径近邻搜索方法,在索引构建与查询时间上均显著优于暴力法和基于树的方法,可证明返回精确结果,且无需参数调优。SNN利用数据点按第一主成分的排序结果来裁剪查询搜索空间,还通过采用高层基本线性代数子程序(BLAS)的高效实现进一步提升速度。我们对该方法进行了理论分析,并验证了其独立使用及应用于DBSCAN聚类算法时的实际性能。

英文摘要:

Fixed-radius near neighbor search is a fundamental data operation that retrieves all data points within a user-specified distance to a query point. There are efficient algorithms that can provide fast approximate query responses, but they often have a very compute-intensive indexing phase and require careful parameter tuning. Therefore, exact brute force and tree-based search methods are still widely used. Here we propose a new fixed-radius near neighbor search method, called SNN, that significantly improves over brute force and tree-based methods in terms of index and query time, provably returns exact results, and requires no parameter tuning. SNN exploits a sorting of the data points by their first principal component to prune the query search space. Further speedup is gained from an efficient implementation using high-level Basic Linear Algebra Subprograms (BLAS). We provide theoretical analysis of our method and demonstrate its practical performance when used stand-alone and when applied within the DBSCAN clustering algorithm.

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

↑