FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
-
Updated
Jun 1, 2024 - C
FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
A backup suite. Supports FLZMA2, bzip3, LZ4, Zstandard, LSH i-node ordering deduplicating archiver, long range deduplication, encryption and recovery records
Experimental implementation of the paper 'Locality-Sensitive Hashing of Curves' published by A. Driemel and F. Silvestri
Neighbor Search and Clustering for Time-Series using Locality-sensitive hashing and Randomized Projection to Hypercube. Time series comparison is performed using Discrete Frechet or Continuous Frechet metric.
Vectors - Nearest neighbor search and Clustering using LSH, Hypercube (and Lloyd's only at the clustering) algorithms with L2 metric.
Collection of clustering algorithms for polygonal curves.
Neighbor Search and Clustering for Vectors using Locality-sensitive hashing and Randomized Projection to Hypercube
Near neighbor searching and clustering using LSH
Approximate vector similarity search and clustering using Locality Sensitive Hashing (LSH), Hypercube, and k-medians
📈|Time Series - Nearest neighbor search and Clustering using LSH, Hypercube (and Lloyd's only at the clustering) algorithms with metrics: L2, Discrete and Continuous Fréchet.
Add a description, image, and links to the lsh topic page so that developers can more easily learn about it.
To associate your repository with the lsh topic, visit your repo's landing page and select "manage topics."