Alternatives and similar repositories for lshensemble

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

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 6 months ago
• ekzhu / lsh
  Locality Sensitive Hashing for Go (Multi-probe LSH, LSH Forest, basic LSH)
  ☆107Updated 7 years ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆119Updated last year
• ekzhu / go-set-similarity-search
  Efficient set similarity search algorithms implemented in Go
  ☆35Updated 3 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 6 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• dgryski / go-minhash
  BottomK minwise hashing for streaming set similarity
  ☆43Updated 6 years ago
• rinx / alvd
  alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.
  ☆49Updated 4 years ago
• pantsing / flylsh
  A Brand New LSH: The fly’s olfactory circuits algorithm
  ☆11Updated 7 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆30Updated 3 months ago
• ekzhu / josie
  Code and Benchmarks for JOSIE (SIGMOD 2019)
  ☆19Updated 2 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• dncc / qpick
  Search for similar short strings
  ☆53Updated 5 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated last year
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 10 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆141Updated 8 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 3 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years ago
• brandonrobertz / SparseLSH
  A Locality Sensitive Hashing (LSH) library with an emphasis on large, highly-dimensional datasets.
  ☆148Updated last year
• seiflotfy / adaptive
  Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
  ☆37Updated 8 years ago
• aaw / histosketch
  A golang streaming histogram sketch. Fast quantiles and counts below a threshold.
  ☆44Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆35Updated 2 months ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago