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 6 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 6 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- Python tools for Morse Smale Complex analysis and visualization☆10Updated 3 years ago
- Dirichlet Process K-means☆48Updated last year
- MCMC for the Dark Energy Spectroscopic Instrument☆13Updated 9 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆11Updated 5 years ago
- Scalable analysis of large high-dimensional data☆66Updated 5 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- AutoInit: Analytic Signal-Preserving Weight Initialization for Neural Networks☆28Updated 2 years ago
- Convenient hyperparameter optimization☆14Updated last year
- Dynamic weighted sampling with replacement☆14Updated 9 years ago
- A conda-smithy repository for python-spams.☆23Updated 7 months ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 4 years ago
- ☆29Updated last year
- Soft Decision Trees (code for ICPR 21 paper)☆32Updated 11 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- A multi-algorithm Python framework for regularized regression☆13Updated last year
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- ☆34Updated 7 years ago
- ☆16Updated 8 years ago
- Collection of notebooks exploring conv nets in detail.☆10Updated 7 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- Wasserstein regularization for sparse multi-task regression☆15Updated 4 years ago
- LaTeX source code for the slides☆23Updated 3 years ago
- Information Theoretic Clustering using Minimum Spanning Trees☆20Updated 7 years ago
- FRP: Fast Random Projections☆43Updated 5 years ago
- Implementations of matrix factorization/completion (and something related) algorithms☆21Updated 8 years ago
- Source code for ``How far can we go without convolution: Improving fully-connected networks'' published at ICLR 2016 workshop☆13Updated 9 years ago
- Implementation of fast exact k-means algorithms☆45Updated 5 years ago