ZJULearning / RPLSHLinks
Kmeans Quantization + Random Projection based Locality Sensitive Hashing
☆28Updated 6 years ago
Alternatives and similar repositories for RPLSH
Users that are interested in RPLSH are comparing it to the libraries listed below
Sorting:
- Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search☆36Updated 5 years ago
- Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…☆59Updated 4 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 6 years ago
- Multi-index hashing for the resolution of ANN search problem on large datasets☆15Updated 6 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Source code for learning and evaluation different quantzation methods☆26Updated 10 years ago
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆58Updated 11 months ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…☆35Updated 5 years ago
- PQ Fast Scan☆62Updated 6 years ago
- TSDG: An efficient index graph for graph-based nearest neighbor search☆9Updated 2 years ago
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 11 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆61Updated 6 years ago
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- ☆31Updated 7 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- ☆13Updated 6 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Implementation of HNSW that supports online updates☆66Updated 7 years ago
- How should we evaluate supervised hashing☆28Updated 6 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆95Updated 5 years ago
- Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)☆25Updated 3 years ago
- State-of-the-art method for large-scale ANN search as of Oct 2016. Presented at ECCV 16.☆75Updated 7 years ago
- Anchor-t-SNE for large-scale and high-dimension vector visualization☆55Updated 5 years ago
- ☆37Updated 4 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆60Updated 3 months ago
- Implementation of our ICCV 2017 paper: MIHash - Hashing with Mutual Information☆34Updated 3 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆54Updated 4 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Updated last year