Our great sponsors
-
annoy
Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Hi, I have a huge list of hashes of images, that I have to compare and find matching items and delete duplicates. Is there something similar to spotify/annoy in Rust or BK-Tree/VP-Tree implementation? Thanks
-
Take a look at https://github.com/ttempleton/dupcheck as well
-
InfluxDB
Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.
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]