Alternatives and similar repositories for annbench:

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

• matsui528 / rii
  Fast and memory-efficient ANN with a subset-search functionality
  ☆154Updated last year
• DwangoMediaVillage / pqkmeans
  Fast and memory-efficient clustering
  ☆256Updated last year
• RyanLiGod / hnsw-python
  hnsw implemented by python
  ☆66Updated 5 years ago
• yahoojapan / ngtd
  Serving NGT over HTTP or gRPC ※This project is not maintained. We have moved to a new product, [Vald](https://vald.vdaas.org) .
  ☆38Updated 4 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆51Updated 4 years ago
• matsui528 / nanopq
  Pure python implementation of product quantization for nearest neighbor search
  ☆340Updated last year
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆60Updated 5 years ago
• yahoojapan / yskip
  Incremental Skip-gram Model with Negative Sampling
  ☆69Updated 5 years ago
• yahoojapan / vespa-tutorial
  Japanese tutorial for Vespa
  ☆20Updated 7 years ago
• shiroyagicorp / sitq
  Learning to Hash for Maximum Inner Product Search
  ☆13Updated 3 years ago
• yagays / embedrank
  Python Implementation of EmbedRank
  ☆49Updated 6 years ago
• wantedly / recsys2020-challenge
  ☆32Updated last year
• polm / ipadic-py
  IPAdic packaged for easy use from Python.
  ☆25Updated 3 years ago
• Hiroshiba / pytorch-trainer
  PyTorch's Trainer like Chainer's Trainer
  ☆45Updated 3 years ago
• nyanp / streamdf
  lightweight, fast and robust columnar dataframe for data analytics with online update
  ☆23Updated 3 years ago
• cgtuebingen / ggnn
  GGNN: State of the Art Graph-based GPU Nearest Neighbor Search
  ☆154Updated last month
• WorksApplications / chikkarpy
  Japanese synonym library
  ☆53Updated 3 years ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• 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…
  ☆137Updated last week
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆205Updated 4 years ago
• js1010 / cuhnsw
  CUDA implementation of Hierarchical Navigable Small World Graph algorithm
  ☆155Updated 3 years ago
• WorksApplications / uzushio
  ☆20Updated 2 months ago
• nobu-g / cohesion-analysis
  Code for COLING 2020 Paper
  ☆13Updated 3 weeks ago
• sbintuitions / JMTEB
  The evaluation scripts of JMTEB (Japanese Massive Text Embedding Benchmark)
  ☆53Updated 3 weeks ago
• harsha-simhadri / big-ann-benchmarks
  Framework for evaluating ANNS algorithms on billion scale datasets.
  ☆366Updated last month
• CyberAgent / fast-annotation-tool
  FAST is an annotation tool that focuses on mobile devices. https://aclanthology.org/2021.emnlp-demo.41/
  ☆53Updated 3 years ago
• yahoojapan / AnnexML
  AnnexML is a multi-label classifier designed for extremely large label space.
  ☆105Updated 7 years ago
• yagays / swem
  Python implementation of SWEM (Simple Word-Embedding-based Methods)
  ☆29Updated 2 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago