Alternatives and similar repositories for LorentzianDistanceRetrieval

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

• BorgwardtLab / filtration_curves
  Code for the KDD 2021 paper 'Filtration Curves for Graph Representation'
  ☆18Updated 2 years ago
• lrnzgiusti / on-oversquashing
  Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)
  ☆15Updated 2 years ago
• dms-net / scatteringGCN
  Scattering GCN: overcoming oversmoothness in graph convolutional networks
  ☆25Updated 3 years ago
• chrsmrrs / SpeqNets
  ☆11Updated 2 years ago
• MichailChatzianastasis / GOAT
  Official Code Repository for the paper "Graph Ordering Attention Networks"
  ☆22Updated last year
• ZZYSonny / PlanE
  Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs…
  ☆14Updated last year
• cedricvincentcuaz / GDL
  Code for Online Graph Dictionary Learning
  ☆18Updated 3 years ago
• gasteigerjo / gtn
  Graph transport network (GTN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, an…
  ☆15Updated 2 years ago
• TRI-GNN / TRI-GNN
  ☆12Updated 3 years ago
• PurdueMINDS / size-invariant-GNNs
  Size-Invariant Graph Representations for Graph Classification Extrapolations (ICML 2021 Long Talk)
  ☆23Updated 2 years ago
• YuGuangWang / HaarPool
  PyTorch Codes for Haar Graph Pooling
  ☆11Updated 2 years ago
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• Chen-Cai-OSU / GNN-Over-Smoothing
  A Note On Over-Smoothing for Graph Neural Network
  ☆20Updated 5 years ago
• flyingtango / DiGCL
  The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021
  ☆36Updated 3 years ago
• c-hofer / graph_filtration_learning
  ☆22Updated 4 years ago
• tk-rusch / GraphCON
  GraphCON (ICML 2022)
  ☆59Updated 3 years ago
• trneedham / Spectral-Gromov-Wasserstein
  Graph matching and clustering by comparing heat kernels via optimal transport.
  ☆27Updated 2 years ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆25Updated 4 years ago
• RPaolino / fLode
  ☆18Updated last year
• navid-naderi / WEGL
  The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).
  ☆35Updated 4 years ago
• Graph-COM / SUREL_Plus
  [VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.
  ☆17Updated 6 months ago
• ispamm / MATE
  MetA-Train to Explain
  ☆18Updated 3 years ago
• Mishne-Lab / IGNR
  Implementation of Implicit Graphon Neural Representation
  ☆12Updated 2 years ago
• simondelarue / dynGNN
  Representation and learning framework for dynamic graphs using Graph Neural Networks.
  ☆12Updated 3 years ago
• nkeriven / random-graph-gnn
  ☆12Updated 4 years ago
• SwiftieH / SpGAT
  Spectral Graph Attention Network with Fast Eigen-approximation
  ☆12Updated 3 years ago
• RPaolino / loopy
  ☆11Updated last year
• lxiaorui / ElasticGNN
  Official implementation of the ICML2021 paper "Elastic Graph Neural Networks"
  ☆42Updated 4 years ago
• zekarias-tilahun / SelfGNN
  A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …
  ☆30Updated 3 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
  ☆46Updated 4 years ago