Alternatives and similar repositories for A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening

Users that are interested in A-Unifying-Framework-for-Spectrum-Preserving-Graph-Sparsification-and-Coarsening are comparing it to the libraries listed below

• ebonilla / VGCN
  Variational Graph Convolutional Networks
  ☆23Updated 4 years ago
• cvignac / SMP
  ☆28Updated 3 years ago
• chrsmrrs / sparsewl
  Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"
  ☆22Updated 3 years ago
• Haggaim / InvariantGraphNetworks
  Code for the ICLR 2019 paper "Invariant and Equiovariant Graph Networks"
  ☆24Updated 5 years ago
• BorgwardtLab / WWL
  Wasserstein Weisfeiler-Lehman Graph Kernels
  ☆81Updated 9 months ago
• HekpoMaH / algorithmic-concepts-reasoning
  ☆25Updated 3 years ago
• HongtengXu / gwl
  Gromov-Wasserstein Learning for Graph Matching and Node Embedding
  ☆72Updated 5 years ago
• tech-srl / bottleneck
  Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"
  ☆94Updated 3 years ago
• PurdueMINDS / RelationalPooling
  ☆35Updated 5 years ago
• delta2323 / gnn-asymptotics
  Code for Graph Neural Networks Exponentially Lose Expressive Power for Node Classification.
  ☆30Updated 5 years ago
• GentleZhu / Shift-Robust-GNNs
  "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')
  ☆48Updated 3 years ago
• Graph-COM / SUREL
  [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.
  ☆19Updated last month
• HongtengXu / s-gwl
  Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching
  ☆43Updated 5 years ago
• yang-han / P-reg
  Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)
  ☆34Updated 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
• HongtengXu / Relational-Factorization-Model
  Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
  ☆31Updated 2 years ago
• AaltoPML / Rethinking-pooling-in-GNNs
  ☆62Updated 4 years ago
• balcilar / Spectral-Designed-Graph-Convolutions
  Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper
  ☆50Updated 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
  ☆46Updated 3 years ago
• LingxiaoShawn / PairNorm
  Source code for PairNorm (ICLR 2020)
  ☆77Updated 5 years ago
• matenure / OTCoarsening
  Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
  ☆36Updated 4 years ago
• PurdueMINDS / Equivalence
  Equivalence Between Structural Representations and Positional Node Embeddings
  ☆22Updated 5 years ago
• gasteigerjo / lcn
  Locally corrected Nyström (LCN), as proposed in "Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, …
  ☆19Updated 2 years ago
• tk-rusch / gradientgating
  Gradient gating (ICLR 2023)
  ☆53Updated 2 years ago
• Chen-Cai-OSU / LDP
  LDP for graph classification
  ☆23Updated 5 years ago
• bluer555 / KernelGCN
  Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs
  ☆34Updated 5 years ago
• mengliu1998 / DL4DisassortativeGraphs
  Papers about developing DL methods on disassortative graphs
  ☆48Updated 2 years ago
• FFTYYY / TWIRLS
  The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".
  ☆43Updated 3 years ago
• BorgwardtLab / MotiFiesta
  Approximate subgraph motif mining through learnable edge contraction.
  ☆13Updated last year
• snap-research / non-contrastive-link-prediction
  [ICLR 2023] Link Prediction with Non-Contrastive Learning
  ☆26Updated 2 years ago