HongtengXu / Relational-Factorization-ModelLinks
Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)
☆31Updated 2 years ago
Alternatives and similar repositories for Relational-Factorization-Model
Users that are interested in Relational-Factorization-Model are comparing it to the libraries listed below
Sorting:
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 6 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Updated 5 years ago
- Code for Optimal Transport for structured data with application on graphs☆102Updated 2 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- [ICML 2020] "When Does Self-Supervision Help Graph Convolutional Networks?" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen☆110Updated 4 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆46Updated 4 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 5 years ago
- Code for "Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification"☆53Updated 5 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 6 years ago
- Wasserstein Weisfeiler-Lehman Graph Kernels☆83Updated 11 months ago
- Graph Representation Learning via Graphical Mutual Information Maximization☆117Updated 5 years ago
- ☆25Updated 5 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆105Updated 5 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- ☆35Updated 6 years ago
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆58Updated 5 years ago
- Code for the paper "RWR-GAE: Random Walk Regularized Graph Auto Encoder"☆38Updated 2 years ago
- code for the paper in NeurIPS 2019☆40Updated 2 years ago
- informal exposition of Weisfeiler-Leman similarity☆28Updated 4 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- Graph meta learning via local subgraphs (NeurIPS 2020)☆126Updated last year
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- Source code for PairNorm (ICLR 2020)☆79Updated 5 years ago
- Official Implementation of ICML 2019 Paper. MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing; an…☆124Updated 6 years ago