最近邻搜索 算法 2024-01-05 本文总共 318 字 · 阅读全文大约需要 1 分钟 一、最近邻搜索 1. 随机k-d树算法 (The Randomized k-d TreeAlgorithm) 2. 优先搜索k-means树算法 (The Priority Search K-MeansTree Algorithm) 3. 层次聚类树 (The Hierarchical ClusteringTree) 二、近似最近邻搜索 1. Annoy (Approximate Nearest Neighbors Oh Yeah) 2. ScaNN (Scalable Nearest Neighbors) 3. Faiss (Billion-scale similarity search with GPUs) 4. Hnswlib (fast approximate nearest neighbor search) Prev Next