Locality-Sensitive Hashing Techniques for Nearest Neighbor Search

  • Lee K
N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

When the volume of data grows big, some simple tasks could become a significant concern. Nearest neighbor search is such a task which finds from a data set the k nearest data points to queries. Locality-sensitive hashing techniques have been developed for approximate but …

Cite

CITATION STYLE

APA

Lee, K. M. (2012). Locality-Sensitive Hashing Techniques for Nearest Neighbor Search. International Journal of Fuzzy Logic and Intelligent Systems, 12(4), 300–307. https://doi.org/10.5391/ijfis.2012.12.4.300

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free