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)
☆65Updated 6 years ago
Related projects: ⓘ
- Python tools for Morse Smale Complex analysis and visualization☆10Updated 2 years ago
- Easing non-convex optimization with neural networks.☆22Updated 6 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆19Updated 4 years ago
- A library for hypergraphs and hypergraph algorithms☆28Updated 8 years ago
- MCMC for the Dark Energy Spectroscopic Instrument☆13Updated 8 years ago
- Dirichlet Process K-means☆46Updated 3 months ago
- Implementation of Trimmed Grassmann Average (TGA) by Hauberg S et al. in Python☆23Updated 8 years ago
- Implementation of accurate coresets for known problems from the field of machine learning.☆10Updated 4 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆17Updated 4 years ago
- ☆16Updated 7 years ago
- Code for "Fast Unbalanced Optimal Transport on a Tree" (NeurIPS 2020)☆12Updated 3 years ago
- A curated list of reading material and lecture notes for all things geometry. Mostly focussed on differential and Riemannian geometry wit…☆18Updated 6 years ago
- Computation using data flow graphs for scalable machine learning☆24Updated 6 years ago
- FRP: Fast Random Projections☆43Updated 4 years ago
- Optimally-weighted herding is Bayesian Quadrature☆16Updated 8 years ago
- Convenient hyperparameter optimization☆14Updated 4 months ago
- Code for Fast Information-theoretic Bayesian Optimisation☆16Updated 6 years ago
- Examples of more involved applications using Geomstats☆32Updated 3 years ago
- MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.☆54Updated 5 years ago
- Statistical adaptive stochastic optimization methods☆32Updated 4 years ago
- ☆17Updated this week
- ☆45Updated 4 years ago
- ☆37Updated 4 years ago
- Functional TensorFlow Implementation of Singular Value Decomposition for paper Fast Graph Learning☆14Updated 3 years ago
- Python Framework for sparse neural networks☆19Updated 7 years ago
- ☆15Updated 7 years ago
- Code for "Deep Convolutional Networks as shallow Gaussian Processes"☆15Updated 5 years ago
- fast kernel evaluation in high dimensions via hashing☆23Updated 3 years ago
- A PyTorch library for differentiable submodular minimization.☆57Updated 6 years ago
- Scalable Log Determinants for Gaussian Process Kernel Learning (https://arxiv.org/abs/1711.03481) (NIPS 2017)☆18Updated 6 years ago