rasmus-pagh / coveringLSHLinks
Simple implementation of CoveringLSH
☆10Updated 9 years ago
Alternatives and similar repositories for coveringLSH
Users that are interested in coveringLSH are comparing it to the libraries listed below
Sorting:
- fast kernel evaluation in high dimensions via hashing☆23Updated 5 years ago
- Probabilistic Itemset Mining☆19Updated 9 years ago
- ☆11Updated 9 years ago
- ☆16Updated 9 years ago
- The information sieve for discrete variables.☆36Updated 9 years ago
- ☆18Updated 7 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- Probabilistic Sequence Mining☆46Updated 7 years ago
- Topological Anomaly Detection (TAD) per Gartley and Basener 2009☆68Updated 5 years ago
- Scalable Recommendation with Hierarchical Poisson Factorization P Gopalan, JM Hofman, DM Blei UAI, 326-335☆55Updated 10 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 3 years ago
- cache-friendly multithread matrix factorization☆90Updated 9 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 8 months ago
- ☆10Updated 9 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Dynamic version of Poisson Factorization (dPF). dPF captures the changing interest of users and the evolution of items over time accordin…☆48Updated 9 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 8 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 9 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- scikit-learn addon to operate on set/"group"-based features☆41Updated 9 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Implementation of safe offline bandit algorithms.☆10Updated 6 years ago
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- Sklearn implementation of GBM to predict mu(X) and std(X) on heteroscedastic data☆25Updated 9 years ago
- Based on Thompson sampling with the online bootstrap (Dean Eckles, Maurits Kaptein). http://arxiv.org/abs/1410.4009☆11Updated 10 years ago
- Sparse Beta-Divergence Tensor Factorization Library☆48Updated 6 months ago
- Randomized embeddings for extreme learning☆24Updated 10 years ago
- Reimplementation of deepwalk algorithm from https://github.com/phanein/deepwalk☆38Updated 10 years ago
- Theano implementation of GloVe for graphs☆47Updated 10 years ago
- ☆20Updated 8 years ago