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:
- ☆45Updated 6 years ago
- Dirichlet Process K-means☆48Updated last year
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 7 years ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 10 years ago
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- ☆13Updated 5 years ago
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆117Updated 5 years ago
- Statistical adaptive stochastic optimization methods☆32Updated 5 years ago
- ☆16Updated 9 years ago
- Functional ANOVA☆28Updated 11 years ago
- Easing non-convex optimization with neural networks.☆23Updated 7 years ago
- Recursive Self-Organizing Map/Neural Gas.☆54Updated 3 years ago
- A conda-smithy repository for python-spams.☆23Updated last year
- Neighborhood Components Analysis in C++☆38Updated 15 years ago
- AutoInit: Analytic Signal-Preserving Weight Initialization for Neural Networks☆29Updated 3 years ago
- Code for the paper "Learning sparse transformations through backpropagation"☆43Updated 6 years ago
- A Cython interface to FLANN☆24Updated 5 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- ☆29Updated last year
- Notebooks in support of the UMAP paper☆44Updated 4 years ago
- A clean TensorFlow implementation of Concrete Dropout☆22Updated 7 years ago
- 3D Roto-translation equivariant convolutions☆54Updated 7 years ago
- Interpreting neural networks via the STREAK algorithm (streaming weak submodular maximization)☆23Updated 8 years ago
- The Shape of Data: Intrinsic Distance for Comparing Data Distributions☆12Updated 6 years ago
- Research code need not be ugly.☆77Updated 2 years ago
- Variational Information Maximization for Feature Selection☆11Updated 9 years ago
- Variational Bayesian Mixture of Factor Analysers☆24Updated 10 years ago
- A runtime shape checker and auto-annotator for tensor programs (pronounced "stanley")☆40Updated 6 years ago
- diffGrad: An Optimization Method for Convolutional Neural Networks☆55Updated 3 years ago
- This is the official implementation for the paper 'AutoEncoder by Forest'☆75Updated 7 years ago