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 6 years ago
- Notebooks in support of the UMAP paper☆44Updated 3 years ago
- ☆45Updated 5 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆11Updated 5 years ago
- ☆16Updated 8 years ago
- Dirichlet Process K-means☆48Updated last year
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆117Updated 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
- Functional ANOVA☆27Updated 10 years ago
- ☆13Updated 4 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- Python implementation of Robust Continuous Clustering☆107Updated 6 years ago
- Experiments from the article "Tensorial Mixture Models"☆25Updated 7 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- CUDA extension for the SPORCO project☆18Updated 4 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- tensorflow implementation of the Wasserstein (aka optimal transport) distance☆72Updated 4 years ago
- ☆65Updated 5 years ago
- Research code need not be ugly.☆77Updated last year
- Soft Decision Trees (code for ICPR 21 paper)☆33Updated 11 years ago
- SGCRFpy: Sparse Gaussian Conditional Random Fields in Python☆29Updated 8 years ago
- A conda-smithy repository for python-spams.☆23Updated 9 months ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- A highly optimized, parallel implementation of the Batch-OMP version of the KSVD learning algorithm.☆80Updated 5 years ago
- Variational Bayesian Mixture of Factor Analysers☆24Updated 10 years ago
- Convenient hyperparameter optimization☆14Updated last year
- Python implementation of projection losses.☆27Updated 5 years ago
- Progressive Multigrid Eigensolver for Multiscale Angular Embedding Problems☆18Updated 8 years ago
- Variational Information Maximization for Feature Selection☆11Updated 8 years ago