stanford-futuredata / wmsketchLinks
Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
☆39Updated 7 years ago
Alternatives and similar repositories for wmsketch
Users that are interested in wmsketch are comparing it to the libraries listed below
Sorting:
- Python bindings to Succinct Data Structure Library 2.0☆33Updated 6 years ago
- ☆19Updated 7 years ago
- A platform for online learning that curtails data latency and saves you cost.☆47Updated 3 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- communication-efficient distributed coordinate ascent☆91Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Cyclades☆28Updated 7 years ago
- Willump Is a Low-Latency Useful Machine learning Platform.☆44Updated 2 years ago
- SparkTDA is a package for Apache Spark providing Topological Data Analysis Functionalities.☆46Updated 7 years ago
- ☆20Updated 8 years ago
- A primal-dual framework for distributed L1-regularized optimization☆36Updated 9 years ago
- Moments Sketch Code☆40Updated 6 years ago
- Scalable inference for Correlated Topic Models☆30Updated 10 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- Efficient LDA solution on GPUs.☆24Updated 6 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
- A Scalable Auto-ML System☆53Updated 2 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- scikit-learn addon to operate on set/"group"-based features☆41Updated 8 years ago
- Scalable Recommendation with Hierarchical Poisson Factorization P Gopalan, JM Hofman, DM Blei UAI, 326-335☆55Updated 9 years ago
- High-performance Non-negative Matrix Factorizations (NMF) - Python/C++☆49Updated 7 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆57Updated 2 years ago
- Scalable Distributed LDA implementation for Spark & Glint☆28Updated 8 years ago
- Python implementations of the distributed quantile sketch algorithm DDSketch☆88Updated 3 months ago
- Your worst case is our best case.☆139Updated 8 years ago
- Yggdrasil: Faster Decision Trees Using Column Partitioning in Spark☆31Updated 7 years ago
- Theano implementation of GloVe for graphs☆47Updated 10 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Implements the frequent directions algorithm for approximating matrices in streams☆32Updated 8 years ago