Locality Sensitive Hashing with Extended Partitioning Boundaries

Keon Myung Lee

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

Paper Titles

GPR Target Detection Based on Fractal Dimension
p.785

Smart Device Application Development for Remotely Monitoring Green · Leisure Vessels
p.790

Application of Linear Servo Motor in Biochip Microarray Instrument
p.795

Factors Influencing the Performance of Porous Wind Shields
p.799

Locality Sensitive Hashing with Extended Partitioning Boundaries
p.804

Simulation and Analysis on the Best Range of Lift-Off Values in MFL Testing
p.811

Motion Simulation of Underwater Mooring Platform with Ocean Current
p.815

Dynamic Modeling for a Miniature Six-Rotor Unmanned Aerial Vehicle
p.819

Study of Disturbances Model on Carrier-Based Aircraft Landing Process
p.824

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 321-324Locality Sensitive Hashing with Extended...

Locality Sensitive Hashing with Extended Partitioning Boundaries

Abstract:

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. Keywords: locality sensitive hashing, data search, hashing, data analysis

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 321-324)

Pages:

804-807

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.321-324.804

Citation:

Cite this paper

Online since:

June 2013

Authors:

Keon Myung Lee

Keywords:

Data Analysis, Data Search, Hashing, Locality Sensitive Hashing

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

References

[1] P. Indyk and R. Motwani, Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality, Proc. of STOC1998 (1998)

DOI: 10.1145/276698.276876

Google Scholar

[2] K. M. Lee, Locality-sensitive Hashing Techniques for Nearest Neighbor Search, Int. J. of Fuzzy Logic and Intell.Syst., 12(4) (2012)

DOI: 10.5391/ijfis.2012.12.4.300

Google Scholar

[3] M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, Locality-sensitive Hashing Scheme based on p-stable Distribution, Symp. on Computational Geometry, p.253–262 (2004)

DOI: 10.1145/997817.997857

Google Scholar

[4] R. R. Salakhutdinov, G.E. Hinton, Semantic hashing, proc. of SIGIR 2007 (2007)

Google Scholar

[5] A. Gionis, P. Indyk, and R. Motwani, Similarity Search in High Dimensions via Hashing, Proc. of VLDB1999 (1999)

Google Scholar