stanford-futuredata / wmsketch
Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
☆38Updated 6 years ago
Alternatives and similar repositories for wmsketch:
Users that are interested in wmsketch are comparing it to the libraries listed below
- Python bindings to Succinct Data Structure Library 2.0☆30Updated 5 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- Moments Sketch Code☆40Updated 6 years ago
- A platform for online learning that curtails data latency and saves you cost.☆47Updated 3 years ago
- Cyclades☆28Updated 6 years ago
- ☆19Updated 7 years ago
- Willump Is a Low-Latency Useful Machine learning Platform.☆44Updated last year
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 5 years ago
- Implementation of algorithms proposed by [Huang and Kasiviswanathan]☆16Updated 8 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆54Updated 2 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- Next generation graph processing platform☆12Updated 8 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated this week
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- Serverless Scientific Computing☆87Updated 5 years ago
- Simple implementation of CoveringLSH☆11Updated 9 years ago
- Python implementations of the distributed quantile sketch algorithm DDSketch☆86Updated 6 months ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 9 years ago
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 5 years ago
- ☆14Updated 8 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Explaining Inference Queries with Bayesian Optimization☆10Updated 4 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 6 years ago
- communication-efficient distributed coordinate ascent☆90Updated 6 years ago
- A locality-sensitive hashing library☆46Updated 11 years ago
- Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…☆15Updated 10 years ago
- Efficient LDA solution on GPUs.☆24Updated 6 years ago
- SparkTDA is a package for Apache Spark providing Topological Data Analysis Functionalities.☆47Updated 6 years ago
- Bloom + C++☆17Updated 7 years ago