bokveizen / non-fragile-hypercore
[DAMI'23 (ECMLPKDD'23 Journal Track)] Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications
☆11Updated 8 months ago
Related projects ⓘ
Alternatives and complementary repositories for non-fragile-hypercore
- Published as a journal paper at DAMI 2023☆14Updated 11 months ago
- Source code for ICDM 2022 paper "Set2Box: Similarity Preserving Representation Learning for Sets."☆13Updated last year
- KDD23 - Classification of Edge-Dependent Labels of Nodes in Hypergraphs☆16Updated 4 months ago
- WWW22 - MiDaS: Representative Hypergraph Sampling☆12Updated 6 months ago
- The code repository of "Towards Deep Attention in Graph Neural Networks: Problems and Remedies," published in ICML 2023.☆27Updated 4 months ago
- Source code for KAIS (2023) paper "Temporal Hypergraph Motifs" and ICDM 2021 paper "THyMe+: Temporal Hypergraph Motifs and Fast Algorithm…☆11Updated last year
- [ICLR 2023] Link Prediction with Non-Contrastive Learning☆25Updated last year
- An Open and Unified Benchmark for Graph Condensation (submitted to NeurIPS 2024 Datasets and Benchmarks Track)☆11Updated 2 months ago
- Published as a conference paper at ICLR 2024☆17Updated 8 months ago
- Python Implementation for Signed Random Walk with Restart (SRWR)☆8Updated 5 years ago
- A PyTorch implementation of "SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling" paper, which appeared in …☆29Updated 2 years ago
- CAT-Walk is an inducive method that learns hyperedge representations via a novel higher-order random walk, SetWalk.☆11Updated last year
- Easy-to-use framework for graph continual learning with Python☆33Updated last month
- Pytorch implementation of "Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labeled Nodes"☆18Updated 2 years ago
- Source code for VLDB 2020 paper "Hypergraph Motifs: Concepts, Algorithms, and Discoveries."☆15Updated 5 months ago
- WWW21 - How Do Hyperedges Overlap☆16Updated 8 months ago
- Robust Graph Clustering via Meta Weighting for Noisy Graphs (CIKM'23)☆8Updated last year
- Accurate Node Feature Estimation with Structured Variational Graph Autoencoder (KDD 2022)☆18Updated last year
- I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs (AAAI'23)☆33Updated 7 months ago
- Codes for "Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks"☆35Updated last year
- The official source code for Similarity Preserving Adversarial Graph Contrastive Learning (SP-AGCL) at KDD 2023.☆23Updated 9 months ago
- ☆21Updated last year
- This repo contains a reference implementation for the paper "Breaking the Limit of Graph Neural Networks by Improving the Assortativity o…☆31Updated 2 years ago
- ☆18Updated last year
- [WSDM 2024] GAD-NR : Graph Anomaly Detection via Neighborhood Reconstruction☆36Updated last month
- The official implementation of the paper "Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing" (ICLR 2023).☆37Updated 7 months ago
- Papers about hypergraph, their applications, and even similar ideas.☆18Updated 2 years ago
- ☆24Updated 2 years ago
- An Empirical Evaluation of Temporal Graph Benchmark☆28Updated last year
- TREND: TempoRal Event and Node Dynamics for Graph Representation Learning. WWW-2022.☆32Updated 6 months ago