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
Sorting:
- Graph matching and clustering by comparing heat kernels via optimal transport.☆27Dec 8, 2022Updated 3 years ago
- 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
- GOODAT: Towards Test-time Graph Out-of-Distribution Detection☆12Mar 18, 2024Updated last year
- Deep Co-Clustering (SDM'19)☆15Dec 18, 2021Updated 4 years ago
- Wasserstein regularization for sparse multi-task regression☆15Jul 26, 2020Updated 5 years ago
- Galaxy Network Embedding: A Hierarchical Community Structure Preserving Approach☆16Jan 4, 2020Updated 6 years ago
- ☆16Sep 10, 2023Updated 2 years ago
- Scalable Gromov-Wasserstein Learning for Graph Partitioning and Matching☆44Sep 15, 2019Updated 6 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
- ICAE code(An Image Clustering Auto-Encoder Based on Predefined Evenly-Distributed Class Centroids and MMD Distance)☆18Apr 20, 2023Updated 2 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
- IPC: A Graph Data Set Compiled from International Planning Competitions☆47Nov 18, 2019Updated 6 years ago
- Content-aware Neural Hashing for Cold-start Recommendation. SIGIR 2020☆19Jul 31, 2020Updated 5 years ago
- ☆17Sep 20, 2020Updated 5 years ago
- Who Stole the Postage? Fraud Detection in Return-Freight Insurance Claims☆20Aug 20, 2018Updated 7 years ago
- ☆18Jun 21, 2019Updated 6 years ago
- Orgainzed Digital Intelligent Network (O.D.I.N)☆22Oct 30, 2022Updated 3 years ago
- Pytorch Implementation of Graph Convolutional Kernel Networks☆54Dec 11, 2022Updated 3 years ago
- Medical Similarity Dataset creation from SNOMED☆28Jul 14, 2022Updated 3 years ago
- ☆504Jan 13, 2021Updated 5 years ago
- Stochastic algorithms for computing Regularized Optimal Transport☆58Aug 16, 2018Updated 7 years ago
- Code for the icml paper "zero inflated exponential family embedding"☆29Nov 2, 2017Updated 8 years ago
- Deep Multi-Graph Clustering via Attentive Cross-Graph Association☆25Apr 6, 2020Updated 5 years ago
- ☆29Jul 12, 2022Updated 3 years ago
- Implementation of Deep Soft-K means☆29Apr 28, 2021Updated 4 years ago
- Pytorch implementation of Group Equivariant Capsule Networks☆29Jan 10, 2019Updated 7 years ago
- Weekly reading group on Graphs at Mila☆280Apr 25, 2019Updated 6 years ago
- The code of paper "Block Modeling-Guided Graph Convolutional Neural Networks".☆34Dec 21, 2021Updated 4 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
- Structural Deep Clustering Network☆290Jul 6, 2023Updated 2 years ago
- The code of AGCN (Attention-driven Graph Clustering Network), which is accepted by ACM MM 2021.☆36Aug 16, 2024Updated last year
- Weekly reading group on Graphs at Mila☆31Mar 7, 2019Updated 7 years ago
- [ICML 2019] A Robust Meta-Algorithm for Stochastic Optimization☆30Aug 24, 2020Updated 5 years ago