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
- ☆11Updated 9 years ago
- Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).☆39Updated 7 years ago
- Sketching-based Distributed Matrix Computations for Machine Learning☆100Updated 7 years ago
- Probabilistic Sequence Mining☆46Updated 7 years ago
- Common pre-processing in NLP such as PPMI computation, SVD-based dimensionality reduction, and PLSR-based distribution prediction.☆23Updated 7 years ago
- Reimplementation of deepwalk algorithm from https://github.com/phanein/deepwalk☆38Updated 9 years ago
- Implements the Karnin-Lang-Liberty (KLL) algorithm in python☆58Updated 2 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Probabilistic Itemset Mining☆19Updated 9 years ago
- Social Poisson Factorization☆26Updated 6 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
- Implementation of many similarity join algorithms.☆15Updated 11 years ago
- Scalable Recommendation with Hierarchical Poisson Factorization P Gopalan, JM Hofman, DM Blei UAI, 326-335☆55Updated 9 years ago
- The information sieve for discrete variables.☆36Updated 8 years ago
- Randomized embeddings for extreme learning☆24Updated 9 years ago
- Theano implementation of GloVe for graphs☆47Updated 10 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 9 years ago
- ☆10Updated 9 years ago
- ☆16Updated 9 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Sparse Beta-Divergence Tensor Factorization Library☆48Updated 2 months ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 5 months ago
- Convex Polytope Machine☆25Updated 10 years ago
- cache-friendly multithread matrix factorization☆90Updated 9 years ago
- Birkhoff decomposition for doubly stochastic matrices.☆15Updated last year
- MISSION: Ultra Large-Scale Feature Selection using Count-Sketches☆13Updated 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
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago