google / quickshiftLinks
A clustering algorithm that first finds the high-density regions (cluster-cores) of the data and then clusters the remaining points by hill-climbing. Such seedings act as more stable and expressive cluster-cores than the singleton modes found by popular algorithm such as mean shift. (https://arxiv.org/abs/1805.07909)
☆69Updated 7 years ago
Alternatives and similar repositories for quickshift
Users that are interested in quickshift are comparing it to the libraries listed below
Sorting:
- Easing non-convex optimization with neural networks.☆23Updated 7 years ago
- ☆45Updated 5 years ago
- Functional ANOVA☆27Updated 10 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- Dirichlet Process K-means☆48Updated last year
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆116Updated 5 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- ☆16Updated 8 years ago
- Notebooks in support of the UMAP paper☆44Updated 3 years ago
- SGCRFpy: Sparse Gaussian Conditional Random Fields in Python☆29Updated 8 years ago
- ☆13Updated 5 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆11Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated 2 years ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- Convenient hyperparameter optimization☆14Updated last year
- NeurIPS 2019 Paper Implementation☆12Updated 2 years ago
- The Shape of Data: Intrinsic Distance for Comparing Data Distributions☆12Updated 6 years ago
- Jonker-Volgenant / LAPJV algorithm for the linear assignment problem, in Python☆51Updated last year
- Statistical adaptive stochastic optimization methods☆32Updated 5 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- A conda-smithy repository for python-spams.☆23Updated 11 months ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆34Updated 7 years ago
- Neighborhood Components Analysis in C++☆38Updated 15 years ago
- Rudi, A., Camoriano, R. and Rosasco, L., Less is more: Nyström computational regularization. In Advances in Neural Information Processing…☆12Updated 6 years ago
- Recursive Self-Organizing Map/Neural Gas.☆52Updated 2 years ago
- Fork of cma-es library by Nikolaus Hansen☆12Updated 8 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- A clean TensorFlow implementation of Concrete Dropout☆22Updated 7 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 4 years ago