google / quickshift
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)
☆68Updated 6 years ago
Alternatives and similar repositories for quickshift:
Users that are interested in quickshift are comparing it to the libraries listed below
- ☆29Updated 10 months ago
- Rudi, A., Camoriano, R. and Rosasco, L., Less is more: Nyström computational regularization. In Advances in Neural Information Processing…☆12Updated 5 years ago
- Easing non-convex optimization with neural networks.☆22Updated 6 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- McKernel: A Library for Approximate Kernel Expansions in Log-linear Time.☆13Updated 2 years ago
- ☆37Updated 4 years ago
- Code to reproduce all the results in the paper: "Learning dynamics of linear denoising autoencoders." (ICML 2018)☆12Updated 6 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- MCMC for the Dark Energy Spectroscopic Instrument☆13Updated 8 years ago
- Dirichlet Process K-means☆47Updated 8 months ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆55Updated 5 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 3 years ago
- Computation using data flow graphs for scalable machine learning☆24Updated 6 years ago
- ☆16Updated 8 years ago
- Convenient hyperparameter optimization☆14Updated 9 months ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- Code for "Fast Unbalanced Optimal Transport on a Tree" (NeurIPS 2020)☆13Updated 4 years ago
- Dynamic weighted sampling with replacement☆14Updated 8 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Fork of cma-es library by Nikolaus Hansen☆11Updated 7 years ago
- ☆45Updated 5 years ago
- Soft Decision Trees (code for ICPR 21 paper)☆32Updated 10 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Earth mover's distance on Nvidia GPUS☆15Updated 8 years ago
- CUDA extension for the SPORCO project☆18Updated 3 years ago
- Learning algorithms introduced in "A PAC-Bayes Sample Compression Approach to Kernel Methods" (ICML 2011)☆10Updated 10 years ago
- Information Theoretic Clustering using Minimum Spanning Trees☆19Updated 6 years ago
- ☆34Updated 7 years ago