Open-source vector similarity search for Postgres
-
Updated
Oct 14, 2024 - C
Open-source vector similarity search for Postgres
Reference-based alignment and sequence database search of SARS-CoV-2 genomes.
Podium at Artificial Intelligence Cup 2022 - USI
FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
KNN Is A Machine Learning Algorithm For Pattern Recognition That Finds The Nearest K Observations To Predict A Target.
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.
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.
Neighbor Search and Clustering for Vectors using Locality-sensitive hashing and Randomized Projection to Hypercube
Example implementation of "Mueen's Algorithm for Similarity Search" (aka MASS) for ESP32
Experimental implementation of the paper 'Locality-Sensitive Hashing of Curves' published by A. Driemel and F. Silvestri
An MPI based implementation of K-NN search algorithm, aimed for use on CPU clusters.
This code implements fast cosine similarity search between text sentences. You have a database of sentences (can be tweets/ documents etc ) and a list of query sentences. This code searches the database and finds the nearest neighbhor to the given queries using cosine similarity. The code supports 1) brute force search 2) Fast exact search by bu…
Add a description, image, and links to the nearest-neighbor-search topic page so that developers can more easily learn about it.
To associate your repository with the nearest-neighbor-search topic, visit your repo's landing page and select "manage topics."