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
- Open source password manager - Proton Pass • AdSecurely store, share, and autofill your credentials with Proton Pass, the end-to-end encrypted password manager trusted by millions.
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 5 years ago
- Source code of "Segmented GRAPH-BERT Model"☆24Sep 16, 2020Updated 5 years ago
- ☆16Sep 10, 2023Updated 2 years ago
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 3 years ago
- ☆28Jul 12, 2022Updated 3 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 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
- Proton VPN Special Offer - Get 70% off • AdSpecial partner offer. Trusted by over 100 million users worldwide. Tested, Approved and Recommended by Experts.
- Pytorch implementation of NASA: NEURAL ARTICULATED SHAPE APPROXIMATION☆12May 4, 2021Updated 4 years ago
- project GCN-VAE for knowledge graphs☆16Aug 27, 2020Updated 5 years ago
- 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☆13Nov 23, 2020Updated 5 years ago
- [ACL2023, Findings] Source codes for the paper "Werewolf Among Us: Multimodal Resources for Modeling Persuasion Behaviors in Social Deduc…☆16Feb 22, 2025Updated last year
- Deep Co-Clustering (SDM'19)☆15Dec 18, 2021Updated 4 years ago
- Implementation of : "Greene, Derek, Donal Doyle, and Padraig Cunningham. "Tracking the evolution of communities in dynamic social network…☆12May 5, 2022Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- [ICML 2020] "When Does Self-Supervision Help Graph Convolutional Networks?" by Yuning You, Tianlong Chen, Zhangyang Wang, Yang Shen☆112Jun 10, 2021Updated 4 years ago
- Adversarial Attacks on Node Embeddings via Graph Poisoning☆59Dec 23, 2019Updated 6 years ago
- ☆13Nov 19, 2020Updated 5 years ago
- Code for "Learning with minibatch Wasserstein: asymptotic and gradient properties".☆13Apr 9, 2021Updated 4 years ago
- ☆506Jan 13, 2021Updated 5 years ago
- ☆17Oct 22, 2020Updated 5 years ago
- ☆19Mar 3, 2025Updated last year
- Tensorflow: Generalizing Across Domains via Cross-Gradient Training☆15May 11, 2018Updated 7 years ago
- Constrained learning using boxes for event-event relation extraction☆12Aug 5, 2022Updated 3 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click and start building anything your business needs.
- [WWW 2022] "A Simple Framework for Graph Contrastive Learning without Data Augmentation"☆19Feb 19, 2022Updated 4 years ago
- Code for computing Hypergraph Co-Optimal Transport distances☆17Jan 19, 2023Updated 3 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆60Aug 16, 2018Updated 7 years ago
- virtual node analysis on ogb benchmark dataset☆14Mar 9, 2023Updated 3 years ago
- dynnode2vec is a python package that implements algorithms to embed dynamic graphs☆12Aug 12, 2022Updated 3 years ago
- A PyTorch implementation of "Self-Supervised GNN that Jointly Learns to Augment" or "Jointly Learnable Data Augmentations for Self-Superv…☆13Dec 13, 2021Updated 4 years ago
- [NeurIPS 2023] "Combating Bilateral Edge Noise for Robust Link Prediction"☆11Nov 3, 2023Updated 2 years ago