whenever5225

GraphANNS

Graph-based Approximate Nearest Neighbor Search Working off CGraph

MUST

An Effective and Scalable Framework for Multimodal Search with Target Modality

TOGG

Two-stage routing with Optimized Guided search and Greedy algorithm

whenever5225.github.io

个人博客

CGraph

一个简单的跨平台的基于流图的并行计算框架，支持注册依赖、循环执行、条件判断、参数传递、面向切面、自动优化、自定义分区等功能。欢迎star & fork

caiss

一款简单好用的 跨平台/多语言的 相似向量/相似词/相似句 高性能检索引擎。欢迎star & fork。Build together! Power another !

faiss

A library for efficient similarity search and clustering of dense vectors.

ML-in-Action-Code-and-Note

:chart_with_upwards_trend:Machine Learning code in Python3.x. （机器学习实战 py3代码整理）Some notes about the practices:（for reference only）

NGT

Neighborhood Graph and Tree for Indexing High-dimensional Data

nns-meets-deep-rl

Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning

nns_benchmark

Benchmark of Nearest Neighbor Search on High Dimensional Data

nsg

Navigating Spreading-out Graph For Approximate Nearest Neighbor Search

SPTAG

A distributed approximate nearest neighborhood search (ANN) library which provides a high quality vector index build, search and distributed online serving toolkits for large scale vector search scenario.

WEAVESS

A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search

what-is-vs