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
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- ☆19Updated 7 years ago
- Probabilistic Itemset Mining☆19Updated 9 years ago
- Probabilistic Sequence Mining☆45Updated 7 years ago
- Scalable Recommendation with Hierarchical Poisson Factorization P Gopalan, JM Hofman, DM Blei UAI, 326-335☆55Updated 9 years ago
- Collaborative filtering with the GP-LVM☆25Updated 10 years ago
- Based on Thompson sampling with the online bootstrap (Dean Eckles, Maurits Kaptein). http://arxiv.org/abs/1410.4009☆11Updated 10 years ago
- cache-friendly multithread matrix factorization☆89Updated 9 years ago
- The information sieve for discrete variables.☆36Updated 8 years ago
- Implementation of safe offline bandit algorithms.☆10Updated 5 years ago
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 5 years ago
- ☆20Updated 8 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆57Updated 2 years ago
- implementation of ICML 2018 paper, Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples☆76Updated 5 years ago
- Implementation of an algorithm computing the nearest "N" neighbours to a vector, using a collection of hyperplane hashers.☆30Updated 10 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Implementation of model described in 'Learning to Protect Communications with Adversarial Neural Cryptography' (Martín Abadi & David G. A…☆46Updated 8 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Topological Anomaly Detection (TAD) per Gartley and Basener 2009☆69Updated 5 years ago
- ☆10Updated 9 years ago
- Python module for spatial trees☆37Updated 8 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
- scikit-learn addon to operate on set/"group"-based features☆41Updated 9 years ago
- Convex Polytope Machine☆25Updated 10 years ago
- Randomized embeddings for extreme learning☆24Updated 9 years ago
- High-dimensional approximate nearest neighbor in python☆11Updated 6 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago