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 9 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).
  ☆121Updated 2 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• dncc / qpick
  Search for similar short strings
  ☆53Updated 5 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• ekzhu / go-set-similarity-search
  Efficient set similarity search algorithms implemented in Go
  ☆35Updated 3 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆27Updated last month
• ekzhu / josie
  Code and Benchmarks for JOSIE (SIGMOD 2019)
  ☆18Updated 2 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆131Updated 2 years ago
• dgryski / go-minhash
  BottomK minwise hashing for streaming set similarity
  ☆44Updated 6 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated 2 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• axiomhq / hyperminhash
  HyperMinHash: Bringing intersections to HyperLogLog
  ☆306Updated 7 years ago
• dataplayer12 / Fly-LSH
  An implementation of efficient LSH inspired by fruit fly brain
  ☆87Updated 7 years ago
• VincentShenbw / similarityjoin
  Implementation of many similarity join algorithms.
  ☆15Updated 11 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆37Updated 5 years ago
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆58Updated 3 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆143Updated 8 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• aaw / histosketch
  A golang streaming histogram sketch. Fast quantiles and counts below a threshold.
  ☆45Updated 2 years ago
• seiflotfy / adaptive
  Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams
  ☆37Updated 8 years ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆39Updated this week
• rinx / alvd
  alvd = A Lightweight Vald. A lightweight distributed vector search engine works without K8s.
  ☆49Updated 4 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• dbaranchuk / ivf-hnsw
  Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors
  ☆219Updated 5 years ago