geon0325 / Set2BoxLinks
Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."
☆14Updated 2 years ago
Alternatives and similar repositories for Set2Box
Users that are interested in Set2Box are comparing it to the libraries listed below
Sorting:
- WWW22 - MiDaS: Representative Hypergraph Sampling☆12Updated last year
- KDD23 - Classification of Edge-Dependent Labels of Nodes in Hypergraphs☆18Updated last year
- Official Code Repository for the paper "Edge Representation Learning with Hypergraphs" (NeurIPS 2021)☆54Updated 2 years ago
- This repo contains a reference implementation for the paper "Breaking the Limit of Graph Neural Networks by Improving the Assortativity o…☆32Updated 3 years ago
- Published as a journal paper at DAMI 2023☆16Updated 5 months ago
- I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs (AAAI'23)☆38Updated last year
- ☆39Updated 2 years ago
- Official code for "Towards Better Utilzation of Multiple Views for Bundle Recommendation" (CIKM 24 Short)☆20Updated 6 months ago
- A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …☆30Updated 3 years ago
- PyTorch implementation of Pseudo-Riemannian Graph Convolutional Networks (NeurIPS'22))☆16Updated last year
- The PyTorch implementation of Directed Graph Contrastive Learning (DiGCL), NeurIPS-2021☆36Updated 3 years ago
- Official repository of "On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs", CIKM 2022☆17Updated 2 years ago
- Published as a conference paper at ICLR 2024☆24Updated last year
- [ICLR'23] Implementation of "Empowering Graph Representation Learning with Test-Time Graph Transformation"☆59Updated 2 years ago
- CAT-Walk is an inducive method that learns hyperedge representations via a novel higher-order random walk, SetWalk.☆15Updated last year
- Author: Tong Zhao (tzhao2@nd.edu). ICML 2022. Learning from Counterfactual Links for Link Prediction☆70Updated 2 years ago
- Official repository for On Over-Squashing in Message Passing Neural Networks (ICML 2023)☆15Updated last year
- Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction☆38Updated 3 years ago
- Model-Agnostic Augmentation for Accurate Graph Classification (WWW 2022)☆21Updated 3 years ago
- Code for "Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing"☆15Updated last year
- ☆10Updated 4 years ago
- A Note On Over-Smoothing for Graph Neural Network☆20Updated 5 years ago
- The implementation of our NeurIPS 2020 paper "Graph Geometry Interaction Learning" (GIL)☆46Updated 4 years ago
- ☆18Updated last year
- Easy-to-use framework for graph continual learning with Python☆36Updated 9 months ago
- ☆15Updated 2 years ago
- "HomoGCL: Rethinking Homophily in Graph Contrastive Learning" in KDD'23☆13Updated 2 years ago
- The open source code for ICDM2022 paper "Unifying Graph Contrastive Learning with Flexible Contextual Scopes"☆21Updated 2 years ago
- Code repository of "Towards Deep Attention in Graph Neural Networks: Problems and Remedies," published in ICML 2023.☆29Updated 3 months ago
- Official repository for NeurIPS'23 paper: GraphPatcher: Mitigating Degree Bias for Graph Neural Networks via Test-time Augmentation☆16Updated last year