Hierarchical Navigable Small World (HNSW) (k Approximate Nearest Neighbors Search (k-ANNS) Nearest Neighbor Search)
Revision as of 10:31, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(M)$ bytes of memory (https://arxiv.org/abs/1603.09320, "Memory usage is proportional to choice of M") == Description == == Approximate? == Approximate Approximation Factor: ? experimental results == Randomized? == No, deterministic == Model of Computation == == Year == 2018 == Reference == https://doi.org/10.1109/TPAMI.2018.2889473")
Time Complexity
$O(nlogn)$
Space Complexity
$O(M)$ bytes of memory
(https://arxiv.org/abs/1603.09320, "Memory usage is proportional to choice of M")
Description
Approximate?
Approximate
Approximation Factor: ? experimental results
Randomized?
No, deterministic
Model of Computation
Year
2018