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:
- Fast Laplacian Eigenmaps: lightweight multicore LE for non-linear dimensional reduction with minimal memory usage. Outperforms sklearn's …☆23Updated 3 years ago
- Ultrahyperbolic Representation Learning☆13Updated 5 years ago
- GyroSPD: Vector-valued Distance and Gyrocalculus on the Space of Symmetric Positive Definite Matrices☆18Updated 3 years ago
- An Internal Validity Index Based on Density-Involved Distance (2019).☆17Updated 6 months ago
- ☆17Updated 6 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Graph signal processing tutorial, presented at the GraphSiP summer school.☆76Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Updated 2 years ago
- Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".☆53Updated 6 months ago
- A Python Multiple kernel learning library.☆57Updated 6 years ago
- Foundational library for Kernel methods in pattern analysis and machine learning☆42Updated 2 years ago
- PyTorch implementation of the paper "Neural Decomposition: Functional ANOVA with Variational Autoencoders"☆25Updated 5 years ago
- Fast graph-regularized matrix factorization☆20Updated last year
- Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper☆36Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- Python package for graph-based clustering and semi-supervised learning☆94Updated 4 months ago
- A Python implementation of Monge optimal transportation☆49Updated last year
- Code for Optimal Transport for structured data with application on graphs☆101Updated 2 years ago
- Mixture of Gaussian Processes Model for Sparse Longitudinal Data☆37Updated 2 years ago
- Generalized Canonical Correlation Analysis☆51Updated 7 years ago
- A package for Multiple Kernel Learning in Python☆129Updated 2 years ago
- A Pytorch implementation of missing data imputation using optimal transport.☆102Updated 4 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆20Updated 5 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago
- Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"☆29Updated 6 years ago
- A matlab toolbox to perform Wasserstein Dictionary Learning or NMF☆32Updated 9 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
- Riemannian stochastic optimization algorithms: Version 1.0.3☆64Updated 2 years ago