Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
☆37Mar 2, 2021Updated 5 years ago
Alternatives and similar repositories for OTCoarsening
Users that are interested in OTCoarsening are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Graph matching and clustering by comparing heat kernels via optimal transport.☆26Dec 8, 2022Updated 3 years ago
- Hierarchical Multi-View Graph Pooling with Structure Learning (TKDE-2021)☆24Nov 2, 2022Updated 3 years ago
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆32Nov 1, 2022Updated 3 years ago
- GOODAT: Towards Test-time Graph Out-of-Distribution Detection☆12Mar 18, 2024Updated 2 years ago
- ☆15Nov 24, 2020Updated 5 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Source code of "Segmented GRAPH-BERT Model"☆24Sep 16, 2020Updated 5 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆47Mar 13, 2023Updated 3 years ago
- ☆29Jul 12, 2022Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆46Sep 15, 2019Updated 6 years ago
- This is the implementation of OODGAT from KDD'22: Learning on Graphs with Out-of-Distribution Nodes.☆23Sep 2, 2022Updated 3 years ago
- [CIKM-21] Pytorch implementation of LiteGT: Efficient and Lightweight Graph Transformers☆12Nov 16, 2021Updated 4 years ago
- ☆10Jul 2, 2020Updated 5 years ago
- Pytorch implementation of NASA: NEURAL ARTICULATED SHAPE APPROXIMATION☆12May 4, 2021Updated 5 years ago
- project GCN-VAE for knowledge graphs☆16Aug 27, 2020Updated 5 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Implementation of the iPiano algorithm for non-convex and non-smooth optimization as described in [1].☆12Nov 28, 2018Updated 7 years ago
- Source code for the paper "Dual Contrastive Learning Network for Graph Clustering"☆12Jan 9, 2024Updated 2 years ago
- ☆13Mar 26, 2019Updated 7 years ago
- Official Tensorflow Code for the paper "Overcomplete Deep Subspace Clustering Networks" - WACV 2021☆14Nov 23, 2020Updated 5 years ago
- Deep Co-Clustering (SDM'19)☆15Dec 18, 2021Updated 4 years ago
- This is a mirror. Feel free to use the issue tracker. PRs welcome.☆11Jan 13, 2026Updated 5 months ago
- Implementation of : "Greene, Derek, Donal Doyle, and Padraig Cunningham. "Tracking the evolution of communities in dynamic social network…☆12May 5, 2022Updated 4 years ago
- Adversarial Attacks on Node Embeddings via Graph Poisoning☆59Dec 23, 2019Updated 6 years ago
- ☆13Nov 19, 2020Updated 5 years ago
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 5 years ago
- ☆509Jan 13, 2021Updated 5 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- ☆15Feb 12, 2026Updated 4 months ago
- ☆19Mar 3, 2025Updated last year
- Tensorflow: Generalizing Across Domains via Cross-Gradient Training☆15May 11, 2018Updated 8 years ago
- This is the official implementation of "Motif-based Graph Representation Learning with Application to Chemical Molecules".☆11Feb 10, 2023Updated 3 years ago
- Codes for "Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks" paper☆50Feb 27, 2021Updated 5 years ago
- [WWW 2022] "A Simple Framework for Graph Contrastive Learning without Data Augmentation"☆19Feb 19, 2022Updated 4 years ago
- End-to-end encrypted email - Proton Mail • AdSpecial offer: 40% Off Yearly / 80% Off First Month. All Proton services are open source and independently audited for security.
- Stochastic algorithms for computing Regularized Optimal Transport☆61Aug 16, 2018Updated 7 years ago
- [NeurIPS 2023] "Combating Bilateral Edge Noise for Robust Link Prediction"☆11Nov 3, 2023Updated 2 years ago
- ☆11Mar 25, 2025Updated last year
- Open source implementation of Logical Analysis of Data (LAD) Algorithm.☆16Oct 6, 2023Updated 2 years ago
- Wrapper for Mikhail Belkin et. al's Pointcloud LB operator. Not dependent on PCL☆11Apr 11, 2014Updated 12 years ago
- A python implementation of discrete optimal transport with a Tsallis entropy regularization.☆14Oct 23, 2023Updated 2 years ago
- Reproduces the results of MinCutPool as presented in the 2020 ICML paper "Spectral Clustering with Graph Neural Networks for Graph Poolin…☆278Mar 15, 2025Updated last year