edoliberty / streaming-quantilesLinks
Implements the Karnin-Lang-Liberty (KLL) algorithm in python
☆57Updated 2 years ago
Alternatives and similar repositories for streaming-quantiles
Users that are interested in streaming-quantiles are comparing it to the libraries listed below
Sorting:
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Simple implementation of CoveringLSH☆10Updated 9 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Moments Sketch Code☆40Updated 6 years ago
- Python implementations of the distributed quantile sketch algorithm DDSketch☆88Updated 3 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Algorithms for finding quantiles of a data stream☆20Updated 11 years ago
- ☆54Updated 6 years ago
- A platform for online learning that curtails data latency and saves you cost.☆47Updated 3 years ago
- ADWIN is an adaptive sliding window algorithm for detecting change and keeping updated statistics from a data stream, and use it as a bla…☆39Updated 7 years ago
- Simplified Moment Sketch Implemntation☆36Updated 6 years ago
- Streaming estimation of percentiles, especially high percentiles.☆63Updated 12 years ago
- Distributed Numpy☆148Updated 7 years ago
- GrammarViz 2.0 public release:☆124Updated 3 years ago
- ☆11Updated 8 years ago
- ☆40Updated 8 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 7 years ago
- This project implements random forests and gradient boosted decision trees (GBDT). The latter uses gradient tree boosting. Both use ensem…☆129Updated 7 years ago
- LSH index for approximate set containment search☆58Updated 3 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 13 years ago
- Weighted MinHash implementation on CUDA (multi-gpu).☆117Updated last year
- Python bindings for the fast integer compression library FastPFor.☆60Updated last year
- Your worst case is our best case.☆139Updated 8 years ago
- A C++ library for summarizing data streams☆23Updated 6 years ago
- ☆19Updated 7 years ago
- Java implementation of SAX, HOT-SAX, and EMMA☆82Updated last year
- Lossy Counting and Sticky Sampling implementation for efficient frequency counts on data streams.☆63Updated 9 years ago