41 ms·
Fast? The author should remind us the computational complexity of calculating the kNN...
by esafak 1y ago
Fast? The author should remind us the computational complexity of calculating the kNN...
- patcon 1y agoI agree, they should have said it, and I had to go looking too. but it may be that they're just leaving this to others, and talking to ppl who already think about KNN's? http://ann-benchmarks.com/index.html http://ann-benchmarks.com/index.html But yeah, my own research (not just that link) says HNSW's get KNN complexity down to O(log n) for search, and O(n log n) for building the whole index.