Chen-Cai-OSU / LDP
LDP for graph classification
☆23Updated 5 years ago
Alternatives and similar repositories for LDP:
Users that are interested in LDP are comparing it to the libraries listed below
- Code for "Weisfeiler and Leman go sparse: Towards higher-order graph embeddings"☆22Updated 3 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆51Updated 4 years ago
- code for the paper in NeurIPS 2019☆40Updated last year
- ☆35Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- Code for Graphite iterative graph generation☆59Updated 5 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆60Updated 3 years ago
- Compute graph embeddings via Anonymous Walk Embeddings☆81Updated 6 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Equivalence Between Structural Representations and Positional Node Embeddings