Alternatives and similar repositories for pysdsl:

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

• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 6 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• mmihaltz / pysettrie
  python3 package supporting efficient storage and querying of sets of sets using the trie data structure. Supports finding all the superse…
  ☆24Updated last year
• searchivarius / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆56Updated last year
• angeloskath / supervised-lda
  A flexible variational inference LDA library.
  ☆22Updated 5 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 3 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆152Updated 5 months ago
• chagaz / sfan
  Selecting features as (network) nodes
  ☆11Updated 6 years ago
• djsutherland / cyflann
  A Cython interface to FLANN
  ☆25Updated 4 years ago
• dataplayer12 / Fly-LSH
  An implementation of efficient LSH inspired by fruit fly brain
  ☆88Updated 6 years ago
• yunwilliamyu / hyperminhash
  LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash
  ☆51Updated 4 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆19Updated last year
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆50Updated last year
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• mitdbg / lazo
  Sketch and LSH Index library for Java, including OPH methods as well as the Lazo method
  ☆13Updated last year
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆104Updated 9 years ago
• dbunibas / chasebench
  Benchmarking the Chase
  ☆9Updated 7 years ago
• smallk / smallk
  High-performance Non-negative Matrix Factorizations (NMF) - Python/C++
  ☆49Updated 6 years ago
• Tharun24 / MACH
  Extreme Classification in Log Memory via Count-Min Sketch
  ☆46Updated 4 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 10 years ago
• leifwalsh / perfume
  Interactive performance benchmarking in Jupyter
  ☆33Updated last month
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• IntuitionEngineeringTeam / RedBlackPy
  Fast and Scalable Data Structures for Scientific and Quantitative Research.
  ☆12Updated 6 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆57Updated 2 years ago