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
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- Dirichlet Process K-means☆47Updated 7 months ago
- Python tools for Morse Smale Complex analysis and visualization☆10Updated 3 years ago
- Easing non-convex optimization with neural networks.☆22Updated 6 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
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Scalable analysis of large high-dimensional data☆66Updated 5 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 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
- fast kernel evaluation in high dimensions via hashing☆23Updated 4 years ago
- ☆45Updated 5 years ago
- Python implementation of Robust Continuous Clustering☆103Updated 5 years ago
- Experiments from the article "Tensorial Mixture Models"☆25Updated 6 years ago
- McKernel: A Library for Approximate Kernel Expansions in Log-linear Time.☆13Updated 2 years ago
- Python code for intrinsic dimension estimation of generic datasets☆19Updated 6 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆23Updated 7 years ago
- A clustering library for large/temporally evolving datasets☆48Updated 7 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆10Updated 5 years ago
- FRP: Fast Random Projections☆43Updated 4 years ago
- ☆13Updated 4 years ago
- Soft Decision Trees (code for ICPR 21 paper)☆32Updated 10 years ago
- Content Addressable Memory using dimensionality reduction☆12Updated 7 years ago
- A Cython interface to FLANN☆25Updated 4 years ago
- Python implementation of cover trees, near-drop-in replacement for scipy.spatial.kdtree☆32Updated 12 years ago
- The Linear Information Sieve☆16Updated 7 years ago
- Semi-Supervised t-SNE using a Bayesian prior based on partial labelling☆42Updated 8 years ago
- Notebooks in support of the UMAP paper☆44Updated 3 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 3 years ago
- Cover Tree implementation in C++ for k-Nearest Neighbours and range search☆90Updated 4 years ago
- Code for "Training Generative Adversarial Networks with Binary Neurons by End-to-end Backpropagation"☆26Updated 5 years ago