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:
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 9 years ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆34Updated 7 years ago
- Dirichlet Process K-means☆48Updated last year
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- ☆13Updated 4 years ago
- Examples of more involved applications using Geomstats☆32Updated 4 years ago
- ☆45Updated 5 years ago
- Jonker-Volgenant / LAPJV algorithm for the linear assignment problem, in Python☆51Updated last year
- Implementations of several fast approximate algorithms for geometric optimal transport (OT)☆117Updated 5 years ago
- Functional ANOVA☆27Updated 10 years ago
- A Cython interface to FLANN☆24Updated 4 years ago
- ☆29Updated last year
- Python implementation of Robust Continuous Clustering☆106Updated 6 years ago
- Neighborhood Components Analysis in C++☆38Updated 15 years ago
- Easing non-convex optimization with neural networks.☆23Updated 7 years ago
- nptsne is a numpy compatible python binary package that offers a number of APIs for fast tSNE calculation.☆33Updated last month
- Earth mover's distance on Nvidia GPUS☆16Updated 8 years ago
- Subsampled Graph-Based DBSCAN☆11Updated 4 years ago
- Notebooks in support of the UMAP paper☆44Updated 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
- Rectified Factor Networks☆38Updated 5 years ago
- Deprecated repository for "Deep Learning with Topological Signatures"☆36Updated 5 years ago
- FRP: Fast Random Projections☆43Updated 5 years ago
- A highly optimized, parallel implementation of the Batch-OMP version of the KSVD learning algorithm.☆80Updated 5 years ago
- Tensorflow implementation of preconditioned stochastic gradient descent☆34Updated last year
- Soft Decision Trees (code for ICPR 21 paper)☆33Updated 11 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆22Updated 7 years ago
- [ICLR 2019] Learning Representations of Sets through Optimized Permutations☆36Updated 6 years ago
- Variational Bayesian Mixture of Factor Analysers☆24Updated 10 years ago
- Rudi, A., Camoriano, R. and Rosasco, L., Less is more: Nyström computational regularization. In Advances in Neural Information Processing…☆12Updated 5 years ago