Graph-COM / SUREL_Plus
[VLDB'23] SUREL+ is a novel set-based computation framework for scalable subgraph-based graph representation learning.
☆17Updated last year
Alternatives and similar repositories for SUREL_Plus:
Users that are interested in SUREL_Plus are comparing it to the libraries listed below
- Graph Transformers for Large Graphs☆20Updated 9 months ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆19Updated 2 years ago
- The open source code for ICDM2022 paper "Unifying Graph Contrastive Learning with Flexible Contextual Scopes"☆21Updated 2 years ago
- Official implementation of the ICML 2022 paper "Going Deeper into Permutation-Sensitive Graph Neural Networks"☆25Updated 2 years ago
- NeurIPS 2022 paper, SubHypergraph Inductive Neural nEtwork☆16Updated last year
- [KDD 2022] Implementation of "Feature Overcorrelation in Deep Graph Neural Networks: A New Perspective"☆45Updated last year
- DiffWire: Inductive Graph Rewiring via the Lovász Bound. In Proceedings of the First Learning on Graphs Conference. 2022. Adrian Arnaiz-R…☆18Updated 2 years ago
- [ICML 2024] Code for Pairwise Alignment Improves Graph Domain Adaptation (Pair-Align)☆11Updated 8 months ago
- ☆18Updated 2 years ago
- [ICLR'23] Implementation of "Empowering Graph Representation Learning with Test-Time Graph Transformation"☆56Updated last year
- [NeurIPS 2022] The official PyTorch implementation of "Neural Temporal Walks: Motif-Aware Representation Learning on Continuous-Time Dyna…☆53Updated 2 years ago
- The code of paper "Block Modeling-Guided Graph Convolutional Neural Networks".☆31Updated 3 years ago
- CIKM 2021: Pooling Architecture Search for Graph Classification☆19Updated 2 years ago
- Implementation of the KDD'24 paper "LPFormer: An Adaptive Graph Transformer for Link Prediction"☆20Updated last month
- Wasserstein Distance Graph Alignment☆22Updated 4 years ago
- ☆15Updated last year
- Codes for Paper: From Hypergraph Energy Functions to Hypergraph Neural Networks☆21Updated last year
- ☆17Updated last year
- CAT-Walk is an inducive method that learns hyperedge representations via a novel higher-order random walk, SetWalk.☆13Updated last year
- This repo contains a reference implementation for the paper "Breaking the Limit of Graph Neural Networks by Improving the Assortativity o…☆32Updated 3 years ago
- CIKM2022: source code for "hypergraph learning with line expansion" paper☆18Updated last year
- Newton–Cotes Graph Neural Networks: On the Time Evolution of Dynamic Systems☆10Updated last year
- ☆18Updated 2 years ago
- "HomoGCL: Rethinking Homophily in Graph Contrastive Learning" in KDD'23☆12Updated last year
- Pytorch implementation of "Large-Scale Representation Learning on Graphs via Bootstrapping"☆78Updated 3 years ago
- ☆40Updated 6 months ago
- dynamic graph/network embedding/representation methods☆16Updated 4 years ago
- ☆19Updated last year
- [ICLR 2023] Link Prediction with Non-Contrastive Learning☆26Updated 2 years ago
- ☆55Updated 3 years ago