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:
- A Cython interface to FLANN☆24Updated 4 years ago
- ☆45Updated 5 years ago
- Examples of more involved applications using Geomstats☆32Updated 4 years ago
- Notebooks in support of the UMAP paper☆44Updated 4 years ago
- Variational Information Maximization for Feature Selection☆11Updated 9 years ago
- Easing non-convex optimization with neural networks.☆23Updated 7 years ago
- Functional ANOVA☆27Updated 10 years ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆34Updated 7 years ago
- Dirichlet Process K-means☆48Updated last year
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 10 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Neighborhood Components Analysis in C++☆38Updated 15 years ago
- A clean TensorFlow implementation of Concrete Dropout☆22Updated 7 years ago
- Soft Decision Trees (code for ICPR 21 paper)☆33Updated 11 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- McKernel: A Library for Approximate Kernel Expansions in Log-linear Time.☆13Updated 3 years ago
- Cyanure: An Open-Source Toolbox for Empirical Risk Minimization☆64Updated 5 months ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- Research code need not be ugly.☆77Updated 2 years ago
- Statistical adaptive stochastic optimization methods☆32Updated 5 years ago
- Rectified Factor Networks☆37Updated 6 years ago
- Experiments from the article "Tensorial Mixture Models"☆25Updated 7 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
- A highly optimized, parallel implementation of the Batch-OMP version of the KSVD learning algorithm.☆80Updated 5 years ago
- Sparse Beta-Divergence Tensor Factorization Library☆48Updated 4 months ago
- Recursive Self-Organizing Map/Neural Gas.☆52Updated 2 years ago
- ☆74Updated 6 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- Jonker-Volgenant / LAPJV algorithm for the linear assignment problem, in Python☆52Updated last year
- Convenient hyperparameter optimization☆14Updated last year