Alternatives and similar repositories for nndescent

Users that are interested in nndescent are comparing it to the libraries listed below

• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆36Updated 4 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆132Updated 2 months ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆168Updated 4 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆408Updated last week
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆171Updated last month
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆71Updated 6 months ago
• WPJiang / HWTL_SDU-ANNS
  ☆77Updated 10 months ago
• Shekhale / gbnns_dim_red
  Reducing Dimensionality method for Nearest Neighbor Search
  ☆15Updated 4 years ago
• intel / ScalableVectorSearch
  ☆193Updated this week
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 7 years ago
• Jacyhust / LSH-APG
  This is a source code for LSH-APG (PVLDB 2023)
  ☆32Updated last year
• nla-group / classix
  Fast and explainable clustering in Python
  ☆120Updated 8 months ago
• guestrin-lab / ACORN
  state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
  ☆87Updated 8 months ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated 4 years ago
• Patrick-H-Chen / FINGER
  ☆12Updated last year
• Kejing-Lu / hvs
  ☆15Updated 3 years ago
• jalvarm / hcnng
  This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs
  ☆21Updated 5 years ago
• Kingsford-Group / omhismb2019
  ☆23Updated last year
• IntelLabs / VectorSearchDatasets
  ☆26Updated 8 months ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆44Updated 5 years ago
• dnbaker / minicore
  Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.
  ☆34Updated 2 years ago
• ejaasaari / lorann
  Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid indexing on …
  ☆47Updated 3 weeks ago
• vector-index-bench / vibe
  Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…
  ☆25Updated 2 weeks ago
• HuangQiang / P2HNNS
  Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)
  ☆14Updated 4 years ago
• JoshEngels / RangeFilteredANN
  Algorithms for approximate nearest neighbor search with window filters
  ☆43Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆165Updated 8 months ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆57Updated 5 years ago
• rutgers-db / SeRF
  SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
  ☆36Updated 8 months ago