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 4 years ago
- ☆19Updated 7 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 8 years ago
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 5 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Probabilistic Sequence Mining☆46Updated 7 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- ☆11Updated 9 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆59Updated 6 months ago
- ☆16Updated 9 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 2 years ago
- Implementation of safe offline bandit algorithms.☆10Updated 5 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year
- scikit-learn addon to operate on set/"group"-based features☆41Updated 9 years ago
- Probabilistic Itemset Mining☆19Updated 9 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
- The information sieve for discrete variables.☆36Updated 8 years ago
- implementation of ICML 2018 paper, Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples☆76Updated 5 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆54Updated 10 years ago
- locality sensitive hashing☆72Updated 13 years ago
- cache-friendly multithread matrix factorization☆90Updated 9 years ago
- ☆26Updated 8 years ago
- Implementation of model described in 'Learning to Protect Communications with Adversarial Neural Cryptography' (Martín Abadi & David G. A…☆46Updated 8 years ago
- Common pre-processing in NLP such as PPMI computation, SVD-based dimensionality reduction, and PLSR-based distribution prediction.☆23Updated 7 years ago
- Proximal Asynchronous SAGA☆13Updated 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
- Efficiency/Effectiveness Trade-offs in Learning to Rank☆12Updated 7 years ago
- Social Poisson Factorization☆26Updated 6 years ago