mariaderrico / DPA
The DPA package is the scikit-learn compatible implementation of the Density Peaks Advanced clustering algorithm. The algorithm provides robust and visual information about the clusters, their statistical reliability and their hierarchical organization.
☆29Updated 3 years ago
Alternatives and similar repositories for DPA:
Users that are interested in DPA are comparing it to the libraries listed below
- ☆12Updated 5 years ago
- Distance-based Analysis of DAta-manifolds in python☆127Updated 2 weeks ago
- Representation Learning on Topological Domains☆80Updated this week
- Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".☆53Updated 2 months ago
- Official implementation of Joint Multidimensional Scaling☆22Updated last year
- Code corresponding to the paper Diffusion Earth Mover's Distance and Distribution Embeddings☆36Updated 4 months ago
- Bayesian optimization with conformal coverage guarantees☆27Updated 2 years ago
- Statistics on the space of asymmetric networks via Gromov-Wasserstein distance☆13Updated 4 years ago
- ☆30Updated 2 years ago
- A Python package for General Graphical Lasso computation☆35Updated 2 months ago
- Repository for 'Interpretable embeddings from molecular simulations using gaussian mixture variational autoencoders'☆20Updated 5 years ago
- A Python toolkit for dimensionality reduction quality assessment☆15Updated 2 years ago
- My Research Journal covering various topics that interest me. They're mostly scattered notes and resources.☆32Updated 2 years ago
- A Python package for intrinsic dimension estimation☆87Updated 2 months ago
- Differentiable Euler Characteristic Transform☆17Updated 10 months ago
- OTGNN code☆55Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆44Updated 2 years ago
- Library for diffusion maps☆46Updated 3 years ago
- Hamiltonian Dynamics with Non-Newtonian Momentum for Rapid Sampling☆36Updated 3 years ago
- ☆21Updated 2 years ago
- Hodge/Bochner Laplacians of simplicial complexes, their spectra, higher-order diffusion and random walks☆29Updated last year
- Code for computing Hypergraph Co-Optimal Transport distances☆16Updated 2 years ago
- Tensorflow implementation for the SVGP-VAE model.☆22Updated 3 years ago
- Proximal Optimal Transport Modeling of Population Dynamics (AISTATS 2022)☆18Updated last year
- Fast Numba-enabled CPU and GPU computations of Earth Mover's (scipy.stats.wasserstein_distance) and Euclidean distances.☆18Updated 3 months ago
- Topological Graph Neural Networks (ICLR 2022)☆122Updated 2 years ago
- Fast computation of diffusion maps and geometric harmonics in Python. Moved to https://git.sr.ht/~jmbr/diffusion-maps☆41Updated 3 years ago
- Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…☆15Updated 2 years ago
- Code for NeurIPS 2021 paper 'Spatio-Temporal Variational Gaussian Processes'☆47Updated 3 years ago