3 ms·
ANNOY is essentially a binary space partition tree for points without having to worry about sets of points aka polygons?
by AtlasBarfed 3y ago
ANNOY is essentially a binary space partition tree for points without having to worry about sets of points aka polygons?
- fzliu 3y agoLike IVF, Annoy partitions the entire embedding space into high-dimensional polygons. The difference is how the two algorithms do it - IVF (https://zilliz.com/learn/vector-index https://zilliz.com/learn/vector-index) uses centroids, while Annoy (https://zilliz.com/learn/approximate-nearest-neighbor-oh-yeah-ANNOY https://zilliz.com/learn/approximate-nearest-neighbor-oh-yea...) is basically just one big binary tree.