triplej0079 / DeepIM
☆37Updated last year
Alternatives and similar repositories for DeepIM:
Users that are interested in DeepIM are comparing it to the libraries listed below
- Implementation of "ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning" (https://arxiv.org/abs/2…☆24Updated 2 years ago
- ☆10Updated 4 years ago
- DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)☆13Updated 2 years ago
- This repository is the official implementation of Online Influence Maximization under Linear Threshold Model.☆14Updated 4 years ago
- SIGMOD 2018: Online Processing Algorithms for Influence Maximization☆22Updated 6 years ago
- Open-source Library PyGDebias: Graph Datasets and Fairness-Aware Graph Mining Algorithms☆62Updated 9 months ago
- The implementation for DropMessage.☆24Updated last year
- Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling (official code repository)☆28Updated 2 years ago
- Code for the paper "Group-Fairness in Influence Maximization"☆21Updated 5 years ago
- An official PyTorch implementation of "Towards Robust Graph Neural Networks for Noisy Graphs with Sparse Labels" (WSDM 2022))☆32Updated 2 years ago
- ☆19Updated 10 months ago
- Scalable and computationally efficient deep reinforcement learning framework for influence maximization☆11Updated 2 years ago
- How Powerful are Spectral Graph Neural Networks☆70Updated last year
- Adaptive evaluation reveals that most examined adversarial defenses for GNNs show no or only marginal improvement in robustness. (NeurIPS…☆29Updated 2 years ago
- Codes for "Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks"☆37Updated last year
- [WSDM 2024] GAD-NR : Graph Anomaly Detection via Neighborhood Reconstruction☆41Updated 3 months ago
- ☆35Updated last year
- The project is trying to find the most influential group of nodes in a huge social network.(SUSTech AI lab3)☆22Updated 6 years ago
- ☆33Updated last year
- [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods☆120Updated 2 years ago
- Adversarial Attack on Graph Neural Networks as An Influence Maximization Problem☆18Updated 3 years ago
- ICML 2022, Finding Global Homophily in Graph Neural Networks When Meeting Heterophily☆42Updated 2 years ago
- An Empirical Evaluation of Temporal Graph Benchmark☆31Updated last year
- This is the official repository for NeurIPS 2023 paper "Curriculum Learning for Graph Neural Networks: Which Edges Should We Learn First"☆15Updated last year
- Influence Maximization Paper List☆10Updated 2 years ago
- Graph Structured Neural Network☆39Updated 2 years ago
- ☆25Updated 2 years ago
- Boost learning for GNNs from the graph structure under challenging heterophily settings. (NeurIPS'20)☆101Updated 2 years ago
- Simple and Fast State-of-Art Implementation of Influence Maximization Problem☆48Updated 5 years ago
- Implementation of the Influence Maximization Benchmarker (IMB)☆10Updated last year