Locality-sensitive hashing (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(nLkt)$ (pre-processing) $O(L(kt+dnP_2^k))$ (query-time)

Space Complexity

$O(nL)$ hash table cells

(https://en.wikipedia.org/wiki/Locality-sensitive_hashing#LSH_algorithm_for_nearest_neighbor_search)

Description

Approximate?

Approximate

Approximation Factor: c

Randomized?

No, deterministic

Model of Computation

Year

2010

Reference

http://infolab.stanford.edu/~ullman/mmds/ch3n.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Locality-sensitive_hashing_(k_Approximate_Nearest_Neighbors_Search_(k-ANNS)_Nearest_Neighbor_Search)&oldid=44355"