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
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆116Updated 5 years ago
- ☆45Updated 5 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆56Updated 6 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Updated 5 years ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- Tensorflow implementation of preconditioned stochastic gradient descent☆34Updated last year
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆11Updated 5 years ago
- Code of Fair PCA algorithm introduced in the paper "The Price of Fair PCA: One Extra Dimension"☆27Updated 2 years ago
- Dirichlet Process K-means☆48Updated last year
- Examples of more involved applications using Geomstats☆32Updated 4 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 5 years ago
- Interpreting neural networks via the STREAK algorithm (streaming weak submodular maximization)☆23Updated 7 years ago
- Convenient hyperparameter optimization☆14Updated last year
- Recursive Self-Organizing Map/Neural Gas.☆52Updated 2 years ago
- Jonker-Volgenant / LAPJV algorithm for the linear assignment problem, in Python☆51Updated last year
- ☆13Updated 5 years ago
- PANENE: Progressive Approximate NEarest NEighbors☆19Updated 7 months ago
- Variational Information Maximization for Feature Selection☆11Updated 9 years ago
- ☆16Updated 8 years ago
- Python code for intrinsic dimension estimation of generic datasets☆19Updated 6 years ago
- f-divergence based t-SNE☆16Updated 2 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- ☆29Updated 3 years ago
- Parameter-Space Saliency Maps for Explainability☆23Updated 2 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- Implementation of the ALI-G algorithm (PyTorch, Tensorflow)☆22Updated 4 years ago
- Notebooks in support of the UMAP paper☆44Updated 3 years ago