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.
Collection of clustering algorithms for polygonal curves.
Clustering for molecular configurations
Near neighbor searching and clustering using LSH
📈|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 frechet-distance topic page so that developers can more easily learn about it.
To associate your repository with the frechet-distance topic, visit your repo's landing page and select "manage topics."