5 ms·
Spotify uses random hyperplanes to produce a hash where each bit is the sign of the dot product of the query and the hyperplanes (ie “is above or below” the hyp
by nwoli 3y ago
Spotify uses random hyperplanes to produce a hash where each bit is the sign of the dot product of the query and the hyperplanes (ie “is above or below” the hyperplane). Works really well
- AndrewKemendo 3y agoIs there a blog post or something on this?
- gregw134 3y agoI think that's just a variation on locality sensitive hashing. You can find lots of articles online.
- fancy_pantser 3y agoThere's at least a repo: https://github.com/spotify/annoy https://github.com/spotify/annoy
- AndrewKemendo 3y agoThank you!
- ChrisPzilla 3y agoHere is an article on Indexes https://zilliz.com/blog/vector-index https://zilliz.com/blog/vector-index
- nwoli 3y agoIt’s wrong though, annoy is not tree based