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

From Algorithm Wiki

Revision as of 08:29, 10 April 2023 by Admin (talk | contribs) (Created page with "== 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")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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-ANNS_Nearest_Neighbor_Search)&oldid=47269"