An embedded vector database designed to run on edge devices. Lightweight and fast with HNSW indexing algorithm.
-
Updated
May 25, 2024 - Rust
An embedded vector database designed to run on edge devices. Lightweight and fast with HNSW indexing algorithm.
🧿 Pupyl is a really fast image search library which you can index your own (millions of) images and find similar images in milliseconds.
Efficient similarity search and clustering for Ruby
This repository contains a web application that integrates with a music recommendation system, which leverages a dataset of 3,415 audio files, each lasting thirty seconds, utilising a Locality-Sensitive Hashing (LSH) implementation to determine rhythmic similarity, as part of an assignment for the Fundamental of Big Data Analytics (DS2004) course.
Implementation and analysis of various algorithms, libraries and systems, distributed and not, for Approximate Nearest Neighbors searches
Nearest neighbor search. Methods: LSH, hypercube, and exhaustive search. C++
Implementation of Memorizing Transformers (ICLR 2022), attention net augmented with indexing and retrieval of memories using approximate nearest neighbors, in Pytorch
Swift bindings for Annoy (Approximate Nearest Neighbors Oh Yeah)
PyTorch library for transforming entities like companies, products, etc. into vectors to support scalable Record Linkage / Entity Resolution using Approximate Nearest Neighbors.
Worth-reading papers and related awesome resources on matching task. 值得一读的匹配任务相关论文与资源集合
A Julia wrapper for Fast Library for Approximate Nearest Neighbors (FLANN)
⚡ Scalable recommendation serving and vector similarity search
Navigable Small World Graphs For Approximate Nearest Neighbors In Rust
Add a description, image, and links to the approximate-nearest-neighbors topic page so that developers can more easily learn about it.
To associate your repository with the approximate-nearest-neighbors topic, visit your repo's landing page and select "manage topics."