brj0 / nndescent
C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
☆17Updated last month
Related projects: ⓘ
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 3 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 3 years ago
- Parameterless and Universal FInding of Nearest Neighbors☆56Updated 4 months ago
- TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation☆14Updated last year
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆19Updated 9 months ago
- Fast and memory-efficient clustering + coreset construction, including fast distance kernels for Bregman and f-divergences.☆33Updated last year
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- Graph Library for Approximate Similarity Search☆85Updated 4 months ago
- A framework for index based similarity search.☆19Updated 5 years ago
- ☆23Updated 9 months ago
- CUDA implementation of Hierarchical Navigable Small World Graph algorithm☆135Updated 3 years ago
- generalized principal component analysis (GLM-PCA) implemented in python☆56Updated 3 years ago
- Affinity Propagation for Sparse Similarities☆21Updated 13 years ago
- Efficient sparse matrix implementation for various "Principal Component Analysis"☆11Updated 5 years ago
- A Python package for hubness analysis and high-dimensional data mining☆44Updated 3 months ago
- Implementation of a Backpack Quotient Filter☆10Updated last month
- Parallel Implementation of HMM on Multicore Platform☆24Updated last year
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆62Updated 2 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 11 years ago
- A library to simulate single-cell data☆2Updated last year
- Genie: Fast and Robust Hierarchical Clustering with Noise Point Detection - in Python and R☆58Updated 3 weeks ago
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆18Updated 3 years ago
- Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++☆29Updated 7 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆70Updated 3 years ago
- ☆21Updated 5 years ago
- Fast and explainable clustering in Python☆103Updated last month
- ☆11Updated 6 years ago
- Fast hierarchical clustering routines for R and Python.☆134Updated 2 months ago
- C++ port of the UMAP algorithm☆41Updated 2 weeks ago