matenure / OTCoarseningView external linksLinks
Unsupervised Learning of Graph Hierarchical Abstractions with Differentiable Coarsening and Optimal Transport
☆37Mar 2, 2021Updated 4 years ago
Alternatives and similar repositories for OTCoarsening
Users that are interested in OTCoarsening are comparing it to the libraries listed below
Sorting:
- Gromov-Wasserstein Factorization Models for Graph Clustering (AAAI-20)☆31Nov 1, 2022Updated 3 years ago
- Hierarchical Multi-View Graph Pooling with Structure Learning (TKDE-2021)☆24Nov 2, 2022Updated 3 years ago
- Official Tensorflow Code for the paper "Overcomplete Deep Subspace Clustering Networks" - WACV 2021☆13Nov 23, 2020Updated 5 years ago
- Source code of "Segmented GRAPH-BERT Model"☆24Sep 16, 2020Updated 5 years ago
- Tensorflow implementation for Deep Cognitive Subspace Clustering (DeepCogSC)☆11Nov 6, 2019Updated 6 years ago
- ☆15Nov 24, 2020Updated 5 years ago
- Deep Co-Clustering (SDM'19)☆15Dec 18, 2021Updated 4 years ago
- A simple Delaunay mesh generator based on the Bowyer-Watson algorithm. I have based my code on the pseudocode present in the Wikipedia pa…☆16Oct 2, 2020Updated 5 years ago
- [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
- ☆16Sep 10, 2023Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 15, 2019Updated 6 years ago
- ICAE code(An Image Clustering Auto-Encoder Based on Predefined Evenly-Distributed Class Centroids and MMD Distance)☆18Apr 20, 2023Updated 2 years ago
- DeepProfile framework, which learns a variational autoencoder (VAE) network from a vast quantity of publicly available gene expression sa…☆19Jun 7, 2018Updated 7 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
- Implementation of the Gromov-Wasserstein distance to the setting of Unbalanced Optimal Transport☆45Mar 13, 2023Updated 2 years ago
- ☆17Sep 20, 2020Updated 5 years ago
- Content-aware Neural Hashing for Cold-start Recommendation. SIGIR 2020☆19Jul 31, 2020Updated 5 years ago
- project GCN-VAE for knowledge graphs☆16Aug 27, 2020Updated 5 years ago
- Deep learning and natural language processing tutorial in PyTorch☆23Feb 8, 2018Updated 8 years ago
- ☆18Jun 21, 2019Updated 6 years ago
- Reproduces the results of MinCutPool as presented in the 2020 ICML paper "Spectral Clustering with Graph Neural Networks for Graph Poolin…☆277Mar 15, 2025Updated 11 months ago
- ☆504Jan 13, 2021Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Aug 16, 2018Updated 7 years ago
- Adversarial Attacks on Node Embeddings via Graph Poisoning☆60Dec 23, 2019Updated 6 years ago
- Implementation of Deep Soft-K means☆29Apr 28, 2021Updated 4 years ago
- Code for the icml paper "zero inflated exponential family embedding"☆29Nov 2, 2017Updated 8 years ago
- ☆29Jul 12, 2022Updated 3 years ago
- Deep Multi-Graph Clustering via Attentive Cross-Graph Association☆25Apr 6, 2020Updated 5 years ago
- Pytorch implementation of Group Equivariant Capsule Networks☆29Jan 10, 2019Updated 7 years ago
- Graph meta learning via local subgraphs (NeurIPS 2020)☆126Jul 25, 2024Updated last year
- 使用Python复现SIGKDD2017的PAMAE算法(并行k-medoids算法)/The Python implementation of SIGKDD 2017's PAMAE algorithm (parallel k-medoids algorithm)☆33Jan 1, 2020Updated 6 years ago
- Weekly reading group on Graphs at Mila☆280Apr 25, 2019Updated 6 years ago
- Code for experimentation on graph scattering transforms☆30Oct 27, 2019Updated 6 years ago
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding☆73Aug 20, 2019Updated 6 years ago
- The code of AGCN (Attention-driven Graph Clustering Network), which is accepted by ACM MM 2021.☆36Aug 16, 2024Updated last year
- [ICML 2019] A Robust Meta-Algorithm for Stochastic Optimization☆30Aug 24, 2020Updated 5 years ago
- [WWW'23] "SimRec: Graph-less Collaborative Filtering"☆32May 6, 2023Updated 2 years ago
- Weekly reading group on Graphs at Mila☆31Mar 7, 2019Updated 6 years ago
- Graph Information Bottleneck (GIB) for learning minimal sufficient structural and feature information using GNNs☆138Nov 29, 2022Updated 3 years ago