HongtengXu / Relational-Factorization-Model
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
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆72Updated 5 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆36Updated 3 years ago
- Learning Autoencoders with Relational Regularization☆45Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 4 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆42Updated 5 years ago
- Variational Graph Convolutional Networks☆22Updated 4 years ago
- Code for Optimal Transport for structured data with application on graphs☆98Updated 2 years ago
- Implementation of SBM-meet-GNN☆22Updated 5 years ago
- ☆35Updated 5 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆40Updated last year
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆31Updated 4 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 3 years ago
- Implementation of Graph Neural Tangent Kernel (NeurIPS 2019)☆103Updated 5 years ago
- The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".☆20Updated 4 years ago
- code for the paper in NeurIPS 2019☆40Updated last year
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 4 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 5 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 4 years ago
- Code for the paper "RWR-GAE: Random Walk Regularized Graph Auto Encoder"☆38Updated last year
- The code for our ICLR paper: StructPool: Structured Graph Pooling via Conditional Random Fields☆57Updated 4 years ago
- Code for Online Graph Dictionary Learning☆15Updated 2 years ago
- ☆30Updated last year
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆45Updated 4 years ago
- Rethinking Graph Regularization for Graph Neural Networks (AAAI2021)☆34Updated 3 years ago
- Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4☆11Updated last year
- Code for "Explainability methods for graph convolutional neural networks" - PE Pope*, S Kolouri*, M Rostami, CE Martin, H Hoffmann (CVPR …☆34Updated 6 months ago