79 Open source projects that are alternatives of or similar to pynanoflann

All the code for a series of Medium articles on Approximate Nearest Neighbors

A k-d tree implementation in Go.

A framework for building (and incrementally growing) graph-based data structures used in hierarchical or DAG-structured clustering and nearest neighbor search

A header-only C++ library for k nearest neighbor search with Eigen3.

Fast and lightweight header-only C++ library (with Python bindings) for approximate nearest neighbor search

Code for papers "Hashing with Mutual Information" (TPAMI 2019) and "Hashing with Binary Matrix Pursuit" (ECCV 2018)

An open-source vector database for embedding similarity search and AI applications.

TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets

Quick ADC

Vald. A Highly Scalable Distributed Vector Search Engine

Open-source vector similarity search for Postgres

📝Awesome and classical image retrieval papers

✏️ Pointillisme tool based on Weighted Voronoi Stippling

Utilities for point cloud processing. read ply, write ply, search nearest neighbors using octree ...

Golang k-D tree implementation with duplicate coordinate support

Open source audio fingerprinting in .NET. An efficient algorithm for acoustic fingerprinting written purely in C#.

A 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.

mlpack: a scalable C++ machine learning library --

Generates stubs for python modules (targeted to C++ extensions compiled with pybind11)

UE4 Plugin: k-d tree

The data structure for unstructured data

Pure python implementation of product quantization for nearest neighbor search

High Dimensional Approximate Near(est) Neighbor

Open source library for scientific HPC

Source Code for KNN Matting, CVPR 2012 / TPAMI 2013. MATLAB code ready to run. Simple and robust implementation under 40 lines.

Code for my PhD thesis. Library of quantization-based methods for fast similarity search in high dimensions. Presented at ECCV 18.

GGNN: State of the Art Graph-based GPU Nearest Neighbor Search

A fast, offline, reverse geocoder

Fast Near-Duplicate Image Search and Delete using pHash, t-SNE and KDTree.

libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretically unlimited number of dimensions, and can store any data structure. Fork of the project once available from http://libkdtree.alioth.debian.org/

FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)

A node.js add-on for performing efficient Nearest Neighbor searches using libkdtree.

Nearest Neighbor Search with Neighborhood Graph and Tree for High-dimensional Data

Web服务：使用腾讯 800 万词向量模型和 spotify annoy 引擎得到相似关键词

Statistical Machine Intelligence & Learning Engine

A scalable nearest neighbor search library in Apache Spark

Training of Locally Optimized Product Quantization (LOPQ) models for approximate nearest neighbor search of high dimensional data in Python and Spark.

A Python package for hubness analysis and high-dimensional data mining

A Python nearest neighbor descent for approximate nearest neighbors

Some useful tips for faiss

an implementation of parallel linear BVH (LBVH) on GPU

😎 A curated list of awesome automatic Python binding generators for C++ projects

LSH index for approximate set containment search

Fast Approximate Nearest Neighbor (ANN) searches with a PostgreSQL database.

Fast and memory-efficient ANN with a subset-search functionality

Benchmarks of approximate nearest neighbor libraries in Python

Benchmarking approximate nearest neighbors. Note: This is an archived version from our SISAP 2017 paper, see below.

Elasticsearch plugin for nearest neighbor search. Store vectors and run similarity search using exact and approximate algorithms.

annoy-rb provides Ruby bindings for the Annoy (Approximate Nearest Neighbors Oh Yeah).

Fast search algorithm for product-quantized codes via hash-tables

K-dimensional tree in Rust for fast geospatial indexing and lookup

Nearest neighbor search for Rails and Postgres

Collections of vector search related libraries, service and research papers

A fast, accurate, and modularized dimensionality reduction approach based on diffusion harmonics and graph layouts. Escalates to millions of samples on a personal laptop. Adds high-dimensional big data intrinsic structure to your clustering and data visualization workflow.

gann(go-approximate-nearest-neighbor) is a library for Approximate Nearest Neighbor Search written in Go

This is an example project using mebedded python in C++ console application using CMake

Misc Statistics and Machine Learning codes in R

python wrapper around C++ spdlog ([email protected]:gabime/spdlog.git)

This repository provides implementation of an incremental k-d tree for robotic applications.

Approximate Nearest Neighbors in C++/Python optimized for memory usage and loading/saving to disk