Alternatives and similar repositories for LorentzianDistanceRetrieval:

Users that are interested in LorentzianDistanceRetrieval are comparing it to the libraries listed below

• yincheng / GGP
  Code and data for the paper `Bayesian Semi-supervised Learning with Graph Gaussian Processes'
  ☆38Updated 6 years ago
• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆22Updated 4 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• cvignac / SMP
  ☆26Updated 3 years ago
• sigvae / SIGraphVAE
  ☆25Updated 5 years ago
• TRI-GNN / TRI-GNN
  ☆11Updated 3 years ago
• 000Justin000 / ssl_edge
  Code for "Graph-based Semi-Supervised & Active Learning for Edge Flows"
  ☆15Updated 5 years ago
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆31Updated 4 years ago
• dalab / matrix-manifolds
  Source code for the "Computationally Tractable Riemannian Manifolds for Graph Embeddings" paper
  ☆35Updated 4 years ago
• 000Justin000 / gnn-residual-correlation
  ☆20Updated 3 years ago
• ermongroup / BCD-Nets
  Code for `BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery`, Neurips 2021
  ☆24Updated 3 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆36Updated 3 years ago
• nikhil-dce / SBM-meet-GNN
  Implementation of SBM-meet-GNN
  ☆22Updated 5 years ago
• danielzuegner / robust-gcn
  Implementation of the paper "Certifiable Robustness and Robust Training for Graph Convolutional Networks".
  ☆42Updated 4 years ago
• armanihm / GDC
  Bayesian Graph Neural Networks with Adaptive Connection Sampling - Pytorch
  ☆57Updated 4 years ago
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆42Updated 5 years ago
• CheriseZhu / GIL
  The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)
  ☆45Updated 4 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• calvin-zcx / ndcn
  Neural Dynamics on Complex Networks
  ☆51Updated 4 years ago
• CheriseZhu / GSSNN
  The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".
  ☆20Updated 4 years ago
• balcilar / gnn-spectral-expressive-power
  Code of "Analyzing the Expressive Power of Graph Neural Networks in a Spectral Perspective" paper published in ICLR2021
  ☆45Updated 3 years ago
• DavidMcDonald1993 / heat
  Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4
  ☆11Updated last year
• zhongyu1998 / PG-GNN
  Official implementation of the ICML 2022 paper "Going Deeper into Permutation-Sensitive Graph Neural Networks"
  ☆25Updated 2 years ago
• xiaoshuai09 / Wasserstein-Learning-For-Point-Process
  learning point processes by means of optimal transport and wasserstein distance
  ☆54Updated 6 years ago
• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated last year
• vikasverma1077 / GraphMix
  Code for reproducing results in GraphMix paper
  ☆72Updated 2 years ago
• Hongrui24 / NeuralHawkesPytorch
  ☆19Updated 4 years ago
• xpuoxford / L2G-neurips2021
  ☆25Updated 3 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆26Updated 2 years ago