VincentShenbw / similarityjoinLinks
Implementation of many similarity join algorithms.
☆15Updated 11 years ago
Alternatives and similar repositories for similarityjoin
Users that are interested in similarityjoin are comparing it to the libraries listed below
Sorting:
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆17Updated 2 years ago
- Implementation of QuadSketch algorithm☆11Updated 2 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 13 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- A flexible variational inference LDA library.☆23Updated 6 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 4 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year
- Efficient and effective query auto-completion in C++.☆55Updated last year
- Semantic embeddings of entities☆66Updated 8 years ago
- A C++ library to benchmark inverted indexes.☆20Updated 4 years ago
- Open-source implementation of Boostexter (Adaboost based classifier)☆57Updated 6 years ago
- DimmWitted Gibbs Sampler in C++ — ⚠️🚧🛑 REPO MOVED TO DEEPDIVE 👉🏿☆17Updated 8 years ago
- Knowledge-based Semantic Role Labeling☆16Updated 5 months ago
- Python wrapper around SVDLIBC, a fast library for sparse Singular Value Decomposition☆55Updated 11 years ago
- C++ implementation of the Hellinger PCA for computing word embeddings.☆32Updated 8 years ago
- Gopalan, P., Ruiz, F. J., Ranganath, R., & Blei, D. M. (2014). Bayesian Nonparametric Poisson Factorization for Recommendation Systems. I…☆15Updated 11 years ago
- SimRank is a measure of similarity between nodes in a directed graph, based on the idea that "two objects are similar if they are related…☆61Updated 7 years ago
- Successor to Annoy https://github.com/spotify/annoy☆13Updated 9 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- google all pairs similarity search package, with swig bindings☆22Updated 10 years ago
- Learning M-Way Tree - Web Scale Clustering - EM-tree, K-tree, k-means, TSVQ, repeated k-means, bitwise clustering☆75Updated 3 years ago
- Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.☆18Updated 8 years ago
- A framework for building reranking models.☆28Updated 10 years ago
- A C++ library providing fast language model queries in compressed space.☆131Updated 2 years ago
- Example project presented at the Succinct Data Structure Tutorial at SIGIR 2016