JAVI897 / Laplacian-EigenmapsLinks
Implemented Laplacian Eigenmaps
☆20Updated 3 years ago
Alternatives and similar repositories for Laplacian-Eigenmaps
Users that are interested in Laplacian-Eigenmaps are comparing it to the libraries listed below
Sorting:
- Python package for graph-based clustering and semi-supervised learning☆95Updated last week
- Fast Laplacian Eigenmaps: lightweight multicore LE for non-linear dimensional reduction with minimal memory usage. Outperforms sklearn's …☆23Updated 3 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆102Updated 4 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Generalized Canonical Correlation Analysis☆51Updated 7 years ago
- An Internal Validity Index Based on Density-Involved Distance (2019).☆17Updated 7 months ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- Ultrahyperbolic Representation Learning☆13Updated 5 years ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- This code accompanies the paper "Persistence Images: A Stable Vector Representation of Persistent Homology".☆43Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- c-lasso: a Python package for constrained sparse regression and classification☆32Updated 4 years ago
- A Python Multiple kernel learning library.☆57Updated 6 years ago
- A Shared Nearest Neighbors clustering implementation. This code is basically a wrapper of sklearn DBSCAN, implementing the neighborhood s…☆14Updated 3 years ago
- ☆118Updated 3 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Updated 5 years ago
- Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".☆53Updated 6 months ago
- ☆17Updated 6 years ago
- A package for Multiple Kernel Learning in Python☆130Updated 2 years ago
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Gabriel Peyré, Marco Cuturi, Justin Solomon, Gromov-Wasserstein Averaging of Kernel and Distance Matrices, Proc. of ICML 2016.☆74Updated 9 years ago
- A Wasserstein Subsequence Kernel for Time Series.☆21Updated last year
- 🤿 Implementation of doubly stochastic deep Gaussian Process using GPflow and TensorFlow 2.0☆26Updated last year
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- Code for the paper "End-to-end training of deep probabilistic CCA on paired biomedical observations".☆28Updated 4 years ago
- Gumbel Graph Network (GGN) : A General Deep Learning Framework for Network Reconstruction☆70Updated 5 years ago
- sliced: scikit-learn compatible sufficient dimension reduction☆19Updated last year