arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.08942cs.DB
收藏

局部敏感散列算法及其应用综述

A Survey on Locality Sensitive Hashing Algorithms and their Applications

Omid Jafari, Preeti Maurya, Parth Nagarkar, Khandker Mushfiqul Islam, Chidambaram Crushev

摘要:

在高维空间中寻找最近邻是许多不同应用领域中的基本操作。局部敏感哈希(LSH)是在高维空间中寻找近似最近邻搜索的最流行的技术之一。LSH的主要优点是它的次线性查询性能和查询精度的理论保证。在这篇调查论文中,我们提供了一个国家的最先进的LSH和分布式LSH技术的审查。最重要的是,与任何其他先前的调查不同,我们介绍了如何在不同的应用领域中使用位置敏感哈希。

英文摘要:

Finding nearest neighbors in high-dimensional spaces is a fundamental operation in many diverse application domains. Locality Sensitive Hashing (LSH) is one of the most popular techniques for finding approximate nearest neighbor searches in high-dimensional spaces. The main benefits of LSH are its sub-linear query performance and theoretical guarantees on the query accuracy. In this survey paper, we provide a review of state-of-the-art LSH and Distributed LSH techniques. Most importantly, unlike any other prior survey, we present how Locality Sensitive Hashing is utilized in different application domains.

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

↑