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)
☆70Updated 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
- Dirichlet Process K-means☆48Updated last year
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆116Updated 5 years ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- ☆13Updated 5 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
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆73Updated 4 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆57Updated 6 years ago
- Implementation of the ALI-G algorithm (PyTorch, Tensorflow)☆22Updated 4 years ago
- Tensorflow implementation of preconditioned stochastic gradient descent☆34Updated 2 years ago
- Examples of more involved applications using Geomstats☆33Updated 4 years ago
- Research code need not be ugly.☆77Updated 2 years ago
- NeurIPS 2019 Paper Implementation☆12Updated 3 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
- A conda-smithy repository for python-spams.☆23Updated last year
- Statistical adaptive stochastic optimization methods☆32Updated 5 years ago
- This code accompanies the proximity variational inference paper.☆18Updated 6 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 8 years ago
- NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.☆67Updated 6 years ago
- A clean TensorFlow implementation of Concrete Dropout☆22Updated 7 years ago
- ☆16Updated 9 years ago
- The Shape of Data: Intrinsic Distance for Comparing Data Distributions☆12Updated 6 years ago
- SGCRFpy: Sparse Gaussian Conditional Random Fields in Python☆29Updated 9 years ago
- Variational Bayesian Mixture of Factor Analysers☆24Updated 10 years ago
- Code for "Deep Convolutional Networks as shallow Gaussian Processes"☆16Updated 6 years ago
- ☆29Updated 4 years ago
- Implicit generative models and related stuff based on the MMD, in PyTorch☆16Updated 5 years ago
- Recursive Self-Organizing Map/Neural Gas.☆53Updated 2 years ago