kdtree-rsK-dimensional tree in Rust for fast geospatial indexing and lookup
Stars: ✭ 137 (+153.7%)
lshensembleLSH index for approximate set containment search
Stars: ✭ 48 (-11.11%)
awesome-vector-searchCollections of vector search related libraries, service and research papers
Stars: ✭ 460 (+751.85%)
pynanoflannUnofficial python wrapper to the nanoflann k-d tree
Stars: ✭ 24 (-55.56%)
wordvector beWeb服务:使用腾讯 800 万词向量模型和 spotify annoy 引擎得到相似关键词
Stars: ✭ 92 (+70.37%)
pqtableFast search algorithm for product-quantized codes via hash-tables
Stars: ✭ 48 (-11.11%)
scikit-hubnessA Python package for hubness analysis and high-dimensional data mining
Stars: ✭ 41 (-24.07%)
MrptFast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search
Stars: ✭ 210 (+288.89%)
ScannsA scalable nearest neighbor search library in Apache Spark
Stars: ✭ 190 (+251.85%)
TarsoslshA Java library implementing practical nearest neighbour search algorithm for multidimensional vectors that operates in sublinear time. It implements Locality-sensitive Hashing (LSH) and multi index hashing for hamming space.
Stars: ✭ 179 (+231.48%)
Faiss tipsSome useful tips for faiss
Stars: ✭ 170 (+214.81%)
ValdVald. A Highly Scalable Distributed Vector Search Engine
Stars: ✭ 158 (+192.59%)
PgannFast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.
Stars: ✭ 156 (+188.89%)
NanopqPure python implementation of product quantization for nearest neighbor search
Stars: ✭ 145 (+168.52%)
ElastiknnElasticsearch plugin for nearest neighbor search. Store vectors and run similarity search using exact and approximate algorithms.
Stars: ✭ 139 (+157.41%)
Knn MattingSource Code for KNN Matting, CVPR 2012 / TPAMI 2013. MATLAB code ready to run. Simple and robust implementation under 40 lines.
Stars: ✭ 130 (+140.74%)
NeighborNearest neighbor search for Rails and Postgres
Stars: ✭ 114 (+111.11%)
RiiFast and memory-efficient ANN with a subset-search functionality
Stars: ✭ 96 (+77.78%)
Ganngann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go
Stars: ✭ 75 (+38.89%)
AnnoyApproximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk
Stars: ✭ 9,262 (+17051.85%)
GgnnGGNN: State of the Art Graph-based GPU Nearest Neighbor Search
Stars: ✭ 63 (+16.67%)
Deep MihashCode for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)
Stars: ✭ 13 (-75.93%)
FalconnFAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)
Stars: ✭ 919 (+1601.85%)
PointcloudutilitiesUtilities for point cloud processing. read ply, write ply, search nearest neighbors using octree ...
Stars: ✭ 17 (-68.52%)
NgtNearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data
Stars: ✭ 636 (+1077.78%)
MilvusAn open-source vector database for embedding similarity search and AI applications.
Stars: ✭ 9,015 (+16594.44%)
SmileStatistical Machine Intelligence & Learning Engine
Stars: ✭ 5,412 (+9922.22%)
SoundfingerprintingOpen source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.
Stars: ✭ 554 (+925.93%)
LopqTraining of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Python and Spark.
Stars: ✭ 530 (+881.48%)
N2TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets
Stars: ✭ 457 (+746.3%)
PynndescentA Python nearest neighbor descent for approximate nearest neighbors
Stars: ✭ 377 (+598.15%)
Mlpackmlpack: a scalable C++ machine learning library --
Stars: ✭ 3,859 (+7046.3%)
lbvhan implementation of parallel linear BVH (LBVH) on GPU
Stars: ✭ 67 (+24.07%)
pgvectorOpen-source vector similarity search for Postgres
Stars: ✭ 482 (+792.59%)
adventures-with-annAll the code for a series of Medium articles on Approximate Nearest Neighbors
Stars: ✭ 40 (-25.93%)
docarrayThe data structure for unstructured data
Stars: ✭ 561 (+938.89%)
graphgroveA framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search
Stars: ✭ 29 (-46.3%)
kdtreeA k-d tree implementation in Go.
Stars: ✭ 98 (+81.48%)
ann-benchmarksBenchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.
Stars: ✭ 30 (-44.44%)
knn-cppA header-only C++ library for k nearest neighbor search with Eigen3.
Stars: ✭ 25 (-53.7%)
DolphinnHigh Dimensional Approximate Near(est) Neighbor
Stars: ✭ 32 (-40.74%)
annoy.rbannoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).
Stars: ✭ 23 (-57.41%)