Locality Sensitive Hashing with Extended Partitioning Boundaries

被引：1

作者：

Lee, Keon Myung ^{[1
]}

机构：

[1] Chungbuk Natl Univ, Dept Comp Sci, Cheongju 361763, Chungbuk, South Korea

来源：

MECHATRONICS AND INDUSTRIAL INFORMATICS, PTS 1-4 | 2013年 / 321-324卷

关键词：

locality sensitive hashing; data search; hashing; data analysis;

D O I：

10.4028/www.scientific.net/AMM.321-324.804

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

Locality-sensitive hashing is a technique to allow approximate nearest search for large volume of data in a fast manner. Binary code locality-sensitive hashing distributes a data set into buckets labeled with binary code, where binary codes are determined by a set of hash functions. The binary hash codes play the role of partitioning the data space into subspaces. When close neighbors are placed around subspace boundaries, there are chances to fail in locating them. It requires to check neighboring buckets while finding nearest ones. The paper presents a technique to enhance the search performance by introducing the notion of extended boundary. It reduces the potential misses and the search overhead especially for the regions located at the double-napped corners.

引用

页码：804 / 807

页数：4