Our great sponsors
-
annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
-
WorkOS
The modern identity platform for B2B SaaS. The APIs are flexible and easy-to-use, supporting authentication, user identity, and complex enterprise features like SSO and SCIM provisioning.
Add your examples to the index and build the trees in annoy. I feel like its straight forward. There you have to provide the dimension of the features which is the feature vector you get. In my case I am reusing (without fine-tuning) the effecientNetB3 without the last layer. Hence it results in feature vectors with 1536 dimensions. https://github.com/spotify/annoy
NOTE:
The number of mentions on this list indicates mentions on common posts plus user suggested alternatives.
Hence, a higher number means a more popular project.
Related posts
- Vector Databases 101
- I'm an undergraduate data science intern and trying to run kmodes clustering. Did this elbow method to figure out how many clusters to use, but I don't really see an "elbow". Tips on number of clusters?
- Calculating document similarity in a special domain
- Can Parquet file format index string columns?
- Billion-Scale Approximate Nearest Neighbor Search [pdf]