Alternatives and similar repositories for streaming-quantiles

Users that are interested in streaming-quantiles 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 7 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆54Updated 10 years ago
• coolwanglu / quantile-alg
  Algorithms for finding quantiles of a data stream
  ☆20Updated 11 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 8 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 6 months ago
• abifet / adwin
  ADWIN is an adaptive sliding window algorithm for detecting change and keeping updated statistics from a data stream, and use it as a bla…
  ☆40Updated 7 years ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆88Updated 5 months ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• GrammarViz2 / grammarviz2_src
  GrammarViz 2.0 public release:
  ☆126Updated 3 years ago
• lateral / hyperplane-hasher
  Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.
  ☆30Updated 10 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆119Updated last year
• optml / CoCoA
  ☆19Updated 7 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆46Updated 4 months ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆59Updated 3 years ago
• fastforwardlabs / cuckoofilter
  ☆40Updated 8 years ago
• fast-pack / PyFastPFor
  Python bindings for the fast integer compression library FastPFor.
  ☆61Updated last year
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• twitter-archive / torch-decisiontree
  This project implements random forests and gradient boosted decision trees (GBDT). The latter uses gradient tree boosting. Both use ensem…
  ☆129Updated 7 years ago
• flexgp / efs
  Evolutionary feature synthesis
  ☆17Updated 10 years ago
• Houzz / annoy2
  ☆26Updated 8 years ago
• All-less / continuum
  A platform for online learning that curtails data latency and saves you cost.
  ☆47Updated 3 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
• VDalibard / BOAT
  ☆54Updated 6 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆87Updated 4 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• jesperborgstrup / Py-IBLT
  A Python implementation of Invertible Bloom Lookup Tables
  ☆81Updated 10 years ago