arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1612.04571cs.DScs.CG
收藏

均匀分布数据点的LSH精细分析

A Refined Analysis of LSH for Well-dispersed Data Points

Wenlong Mou, Liwei Wang

摘要:

近邻问题是高维欧氏空间算法的基础。经典的哈希算法存在维数灾难的问题,而局部敏感哈希算法(LSH)可以有效地解决a-近似r-近邻问题,并被证明在最坏情况下是最优的。然而,对于真实世界的数据集,LSH可以自然地受益于良好分散的数据和低倍维,从而显着提高性能。在本文中,我们解决这个问题,并提出了一个精细的分析,通过LSH近似近邻查询的运行时间。我们用数据点之间b*r-near对的数目N_b来表征数据的分散性。结合最优数据不经意LSH方案,得到了一个新的依赖于N_b和双倍维数的查询时间界。对于许多自然场景中的点是分散的或躺在一个低倍维空间,我们的结果导致更尖锐的性能比现有的最坏情况下的分析。本文不仅首次对LSH如何利用数据点的结构给出了严格的证明,而且对LSH在超越最坏情况的实践中的参数设置提供了重要的见解。此外,在我们的分析技术涉及到一个广义版本的球包装问题,这可能是一些独立的利益。

英文摘要:

Near neighbor problems are fundamental in algorithms for high-dimensional Euclidean spaces. While classical approaches suffer from the curse of dimensionality, locality sensitive hashing (LSH) can effectively solve a-approximate r-near neighbor problem, and has been proven to be optimal in the worst case. However, for real-world data sets, LSH can naturally benefit from well-dispersed data and low doubling dimension, leading to significantly improved performance. In this paper, we address this issue and propose a refined analyses for running time of approximating near neighbors queries via LSH. We characterize dispersion of data using N_b, the number of b*r-near pairs among the data points. Combined with optimal data-oblivious LSH scheme, we get a new query time bound depending on N_b and doubling dimension. For many natural scenarios where points are well-dispersed or lying in a low-doubling-dimension space, our result leads to sharper performance than existing worst-case analysis. This paper not only present first rigorous proof on how LSHs make use of the structure of data points, but also provide important insights into parameter setting in the practice of LSH beyond worst case. Besides, the techniques in our analysis involve a generalized version of sphere packing problem, which might be of some independent interest.

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

↑