Alternatives and similar repositories for Laplacian-Eigenmaps

Users that are interested in Laplacian-Eigenmaps are comparing it to the libraries listed below

• davisidarta / fastlapmap
  Fast Laplacian Eigenmaps: lightweight multicore LE for non-linear dimensional reduction with minimal memory usage. Outperforms sklearn's …
  ☆23Updated 4 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• rupy / GCCA
  Generalized Canonical Correlation Analysis
  ☆51Updated 8 years ago
• BorisMuzellec / MissingDataOT
  A Pytorch implementation of missing data imputation using optimal transport.
  ☆104Updated 4 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 6 years ago
• tvayer / FGW
  Code for Optimal Transport for structured data with application on graphs
  ☆102Updated 2 years ago
• mstrazar / mklaren
  A Python Multiple kernel learning library.
  ☆57Updated 6 years ago
• dmilios / dirichletGPC
  ☆17Updated 6 years ago
• thibsej / unbalanced_gromov_wasserstein
  Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport
  ☆45Updated 2 years ago
• SheffieldML / GPclust
  Collapsed Variational Bayes
  ☆72Updated 6 years ago
• icemiliang / pyvot
  A Python implementation of Monge optimal transportation
  ☆49Updated 2 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆44Updated 6 years ago
• BorgwardtLab / topological-autoencoders
  Code for the paper "Topological Autoencoders" by Michael Moor, Max Horn, Bastian Rieck, and Karsten Borgwardt.
  ☆151Updated 3 years ago
• hichamjanati / spatio-temporal-alignements
  Spatio-temporal alignements: Optimal transport in space and time
  ☆48Updated 6 months ago
• edouardpineau / A-simple-baseline-algorithm-for-graph-classification
  Github page for the paper "A simple baseline algorithm for graph classification" presented at the R2L workshop of NIPS 2018
  ☆28Updated 5 years ago
• francoispierrepaty / SubspaceRobustWasserstein
  Source code for the ICML2019 paper "Subspace Robust Wasserstein Distances"
  ☆29Updated 6 years ago
• tvayer / SGW
  Code for Sliced Gromov-Wasserstein
  ☆69Updated 5 years ago
• spbu-math-cs / Graph-Gaussian-Processes
  Supplementary code for the AISTATS 2021 paper "Matern Gaussian Processes on Graphs".
  ☆53Updated 9 months ago
• PythonOT / COOT
  CO-Optimal Transport
  ☆42Updated 5 years ago
• mdeff / pygsp_tutorial_graphsip
  Graph signal processing tutorial, presented at the GraphSiP summer school.
  ☆77Updated 6 years ago
• crisbodnar / dgm
  Deep Graph Mapper: Seeing Graphs through the Neural Lens
  ☆58Updated 2 years ago
• raamana / kernelmethods
  Foundational library for Kernel methods in pattern analysis and machine learning
  ☆43Updated 2 years ago
• IvanoLauriola / MKLpy
  A package for Multiple Kernel Learning in Python
  ☆131Updated 2 years ago
• sedelmeyer / wasserstein-auto-encoder
  A brief tutorial on the Wasserstein auto-encoder
  ☆85Updated 6 years ago
• MarcTLaw / UltrahyperbolicRepresentation
  Ultrahyperbolic Representation Learning
  ☆13Updated 5 years ago
• lchizat / optimal-transport
  Optimal transport and generalizations
  ☆66Updated 6 years ago
• rymc / n2d
  A deep clustering algorithm. Code to reproduce results for our paper N2D: (Not Too) Deep Clustering via Clustering the Local Manifold of …
  ☆138Updated 2 years ago
• fraenkel-lab / mogp
  Mixture of Gaussian Processes Model for Sparse Longitudinal Data
  ☆38Updated 2 years ago
• mfbalin / Concrete-Autoencoders
  ☆120Updated 3 years ago