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
- ☆45Updated 6 years ago
- Rudi, A., Camoriano, R. and Rosasco, L., Less is more: Nyström computational regularization. In Advances in Neural Information Processing…☆12Updated 6 years ago
- Recursive Self-Organizing Map/Neural Gas.☆52Updated 2 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 10 years ago
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆116Updated 5 years ago
- Dirichlet Process K-means☆48Updated last year
- Notebooks in support of the UMAP paper☆44Updated 4 years ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆11Updated 5 years ago
- ☆13Updated 5 years ago
- Change Detection in Graph Streams by Learning Graph Embeddings on Constant-Curvature Manifolds (2018, https://arxiv.org/abs/1805.06299)☆11Updated 5 years ago
- Examples of more involved applications using Geomstats☆32Updated 4 years ago
- ☆16Updated 8 years ago
- Tensorflow implementation of preconditioned stochastic gradient descent☆34Updated last year
- Experiments from the article "Tensorial Mixture Models"☆25Updated 7 years ago
- CUDA extension for the SPORCO project☆18Updated 4 years ago
- Code of Fair PCA algorithm introduced in the paper "The Price of Fair PCA: One Extra Dimension"☆28Updated 2 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 10 years ago
- Notebooks for IPAM Tutorial, March 15 2019☆24Updated 6 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- Robust PCA in Python☆36Updated 12 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- FRP: Fast Random Projections☆43Updated 5 years ago
- Rectified Factor Networks☆37Updated 6 years ago
- Repository for the code of the paper "Neural Networks Regularization Through Class-wise Invariant Representation Learning".☆12Updated 8 years ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆34Updated 7 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 4 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago