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 5 years ago
- Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport☆37Updated 4 years ago
- Learning Autoencoders with Relational Regularization☆46Updated 4 years ago
- Codes for NIPS 2019 Paper: Rethinking Kernel Methods for Node Representation Learning on Graphs☆34Updated 5 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆43Updated 5 years ago
- Code for reproducing results in GraphMix paper☆72Updated 2 years ago
- Code for: Gradient-based Hierarchical Clustering using Continuous Representations of Trees in Hyperbolic Space. Nicholas Monath, Manzil Z…☆44Updated 5 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Updated 2 years ago
- Code for the paper "RWR-GAE: Random Walk Regularized Graph Auto Encoder"☆38Updated last year
- Code for Optimal Transport for structured data with application on graphs☆100Updated 2 years ago
- Reference implementation of the HEAT algorithm described in https://link.springer.com/chapter/10.1007/978-3-030-62362-3_4☆11Updated 2 years ago
- ☆35Updated 6 years ago
- The implementation code for our paper Wasserstein Embedding for Graph Learning (ICLR 2021).☆35Updated 4 years ago
- Code accompanying the NeurIPS 2019 paper "GOT: An Optimal Transport framework for Graph comparison"☆41Updated last year
- Paper Code Learning Powerful Graph Neural Network Embeddings With Aid Of Transfer Learning☆40Updated 5 years ago
- Variational Graph Convolutional Networks☆23Updated 4 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- Contains the code relative to the paper Partial Gromov-Wasserstein with Applications on Positive-Unlabeled Learning https://arxiv.org/abs…☆21Updated 5 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Updated 4 years ago
- Code for Graphite iterative graph generation☆59Updated 6 years ago
- AISTATS 2019: Confidence-based Graph Convolutional Networks for Semi-Supervised Learning☆59Updated 6 years ago
- Conditional Structure Generation through Graph Variational Generative Adversarial Nets, NeurIPS 2019.☆54Updated 5 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- A Flexible Generative Framework for Graph-based Semi-supervised Learning (NeurIPS 2019)☆16Updated 3 years ago
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Updated 2 years ago
- Implementation of SBM-meet-GNN☆23Updated 6 years ago
- code for the paper in NeurIPS 2019☆40Updated 2 years ago
- ☆25Updated 5 years ago
- [ICML 2020] Differentiating through the Fréchet Mean (https://arxiv.org/abs/2003.00335).☆56Updated 3 years ago
- The implementation of our AAAI 2020 paper "GSSNN: Graph Smoothing Splines Neural Network".☆20Updated 4 years ago