google / quickshift
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)
☆67Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for quickshift
- Easing non-convex optimization with neural networks.☆22Updated 6 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 9 years ago
- MCMC for the Dark Energy Spectroscopic Instrument☆13Updated 8 years ago
- ☆15Updated 10 months ago
- Convenient hyperparameter optimization☆14Updated 6 months ago
- Neighborhood Components Analysis in C++☆38Updated 14 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- Code for our paper "CliqueCNN: Deep Unsupervised Exemplar Learning" https://arxiv.org/abs/1608.08792☆23Updated 7 years ago
- ☆29Updated 7 months ago
- Dirichlet Process K-means☆46Updated 5 months ago
- Similarity Encoder (SimEc) Neural Network Framework for learning low dimensional similarity preserving representations☆17Updated 4 years ago
- Python implementation of Kernelized Locality Sensitive Hashing☆25Updated 8 years ago
- CLARA: Confidence of Labels and Raters☆11Updated last year
- Deep learning of an embedding mapping using t-SNE as a loss function on top of a 3-hidden-layer neural network. Use pytorch !☆21Updated 7 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆10Updated 5 years ago
- A python wrapper for the PROPACK library☆51Updated 7 years ago
- SGCRFpy: Sparse Gaussian Conditional Random Fields in Python☆29Updated 8 years ago
- Jonker-Volgenant / LAPJV algorithm for the linear assignment problem, in Python☆51Updated 11 months ago
- Cooperative Cut is a Markov Random Field inference method with high-order edge potentials.☆23Updated 6 years ago
- A CUDA implementation of non-negative matrix factorization for GPUs.☆35Updated 6 years ago
- Repository for the code of the paper "Neural Networks Regularization Through Class-wise Invariant Representation Learning".☆12Updated 7 years ago
- Source files and notebooks for a paper on accelerating HDBSCAN*☆31Updated 7 years ago
- Graph-based learning in Python☆18Updated 6 years ago
- Soft Decision Trees (code for ICPR 21 paper)☆30Updated 10 years ago
- Simple structured learning framework for python☆38Updated 8 years ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Extreme Learning Machine - C++ library☆33Updated 9 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- A Cython interface to FLANN☆25Updated 3 years ago
- Implementation of Mapper algorithm for Topological Data Analysis☆45Updated 4 years ago