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
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years 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
- Computation using data flow graphs for scalable machine learning☆24Updated 7 years ago
- Easing non-convex optimization with neural networks.☆23Updated 6 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- MCMC for the Dark Energy Spectroscopic Instrument☆13Updated 9 years ago
- SGCRFpy: Sparse Gaussian Conditional Random Fields in Python☆29Updated 8 years ago
- ☆16Updated 8 years ago
- Experiments from the article "Tensorial Mixture Models"☆25Updated 7 years 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
- Code for "Fast Unbalanced Optimal Transport on a Tree" (NeurIPS 2020)☆13Updated 4 years ago
- stochs: fast stochastic solvers for machine learning in C++ and Cython☆26Updated 2 years ago
- QPBO interface and alpha expansion for Python☆24Updated 2 years ago
- Learning algorithms introduced in "A PAC-Bayes Sample Compression Approach to Kernel Methods" (ICML 2011)☆10Updated 10 years ago
- Python tools for Morse Smale Complex analysis and visualization☆10Updated 3 years ago
- McKernel: A Library for Approximate Kernel Expansions in Log-linear Time.☆13Updated 2 years ago
- Neighborhood Components Analysis in C++☆38Updated 15 years ago
- A discrete sequential VAE☆39Updated 5 years ago
- Convenient hyperparameter optimization☆14Updated last year
- ☆29Updated last year
- ☆45Updated 5 years ago
- Soft Decision Trees (code for ICPR 21 paper)☆32Updated 11 years ago
- Scalable Log Determinants for Gaussian Process Kernel Learning (https://arxiv.org/abs/1711.03481) (NIPS 2017)☆18Updated 7 years ago
- Run Pytorch graphs inside Theano graph (and pytorch wrapper for AIS for generative models).☆18Updated 7 years ago
- Simple structured learning framework for python☆38Updated 9 years ago
- Deep Unsupervised Similarity Learning using Partially Ordered Sets (CVPR17)☆20Updated 4 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- A conda-smithy repository for python-spams.☆23Updated 6 months ago
- Tensorflow implementation of preconditioned stochastic gradient descent☆34Updated last year
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago