CUAI / Edge-Proposal-Sets
Edge Proposal Sets for Link Prediction (https://arxiv.org/abs/2106.15810)
☆23Updated last year
Alternatives and similar repositories for Edge-Proposal-Sets:
Users that are interested in Edge-Proposal-Sets are comparing it to the libraries listed below
- [WWW 2021 GLB] New Benchmarks for Learning on Non-Homophilous Graphs☆112Updated 3 years ago
- ☆57Updated 3 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆71Updated 4 years ago
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆58Updated 5 years ago
- Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"☆94Updated 3 years ago
- PyTorch code of "SLAPS: Self-Supervision Improves Structure Learning for Graph Neural Networks"☆87Updated 3 years ago
- "Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data" (NeurIPS 21')☆48Updated 2 years ago
- SIGN: Scalable Inception Graph Network☆96Updated 4 years ago
- [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods☆122Updated 2 years ago
- Measuring and Improving the Use of Graph Information in Graph Neural Networks☆82Updated 9 months ago
- ☆37Updated 3 years ago
- The code for the ICML 2021 paper "Graph Neural Networks Inspired by Classical Iterative Algorithms".☆43Updated 3 years ago
- [ICML 2022] pGNN, p-Laplacian Based Graph Neural Networks☆27Updated 2 years ago
- The official implementation of ''Can Graph Neural Networks Count Substructures?'' NeurIPS 2020☆34Updated 4 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆35Updated 3 years ago
- 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
- Official repository of "On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs", CIKM 2022☆17Updated 2 years ago
- [VLDB'22] SUREL is a novel walk-based computation framework for efficient subgraph-based graph representation learning.☆19Updated 3 weeks ago
- ☆62Updated 4 years ago
- Papers about developing DL methods on disassortative graphs☆48Updated 2 years ago
- [ICLR 2023] Link Prediction with Non-Contrastive Learning☆26Updated 2 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- Implementation of "Bag of Tricks for Node Classification with Graph Neural Networks" based on DGL☆35Updated 3 months ago
- Implementation for Simple Spectral Graph Convolution in ICLR 2021☆83Updated 2 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- ☆39Updated last year
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆45Updated 4 years ago
- ☆134Updated last year
- Code for "Heterogeneous Graph Transformer" (WWW'20), which is based on Deep Graph Library (DGL)☆74Updated 2 years ago
- Source code for From Stars to Subgraphs (ICLR 2022)☆70Updated last year