FFrankyy / FINDERLinks
FINDER - FInding key players in complex Networks through DEep Reinforcement learning (Nature Machine Intelligence)
☆207Updated 2 years ago
Alternatives and similar repositories for FINDER
Users that are interested in FINDER are comparing it to the libraries listed below
Sorting:
- Repository of scripts and data for the "Robustness and resilience of complex networks" paper by Oriol Artime, Marco Grassia, Manlio De Do…☆85Updated 2 weeks ago
- This collection of papers can be used to summarize research about graph reinforcement learning for the convenience of researchers.☆191Updated 10 months ago
- A curated list of graph reinforcement learning papers.☆72Updated 3 years ago
- Repository of the paper "Machine learning dismantling and early-warning signals of disintegration in complex systems" by M. Grassia, M. D…☆43Updated 4 years ago
- Influence maximization in unknown social networks: Learning Policies for Effective Graph Sampling (official code repository)☆29Updated 3 years ago
- Source Code for Paper "Evolutionary Community Detection in Dynamic Social Networks" IJCNN 2019☆15Updated 5 years ago
- a repository for DomiRank along with some code to do efficient node removals and largest-connected-component sampling of massive networks☆51Updated 3 months ago
- This repo contains the codes and data for our Nature Communications paper: Deep learning resilience inference for complex networked syste…☆53Updated 11 months ago
- ☆35Updated 2 years ago
- THAN: Multi-Modal Transportation Recommendation with Heterogeneous Graph Attention Networks☆14Updated 10 months ago
- ☆37Updated 6 years ago
- Graph Neural Network architecture to solve the decision variant of the Traveling Salesperson Problem (is there a Hamiltonian tour in G wi…☆117Updated 5 years ago
- Implementation of ECO-DQN as reported in "Exploratory Combinatorial Optimization with Reinforcement Learning".☆80Updated 4 years ago
- ☆13Updated 2 years ago
- Temporal IMLinUCB - a solution for Online Influence Maximization problem in Temporal Networks (based on IMLinUCB)☆17Updated last year
- codes for paper named influential nodes identification in complex network via information entropy☆30Updated 6 years ago
- Implementation of Learning Combinatorial Optimization Algorithms over Graphs, by Hanjun Dai et al. (2017)☆33Updated 7 years ago
- Source Code for Paper "Transfer Learning Based Multi-Objective Genetic Algorithm for Dynamic Community Detection" (arxiv: https://arxiv.o…☆21Updated last year
- Graph Source Localization Library☆14Updated 10 months ago
- Modeling complex networks: An implementation based on Python+NetworkX☆231Updated last year
- This project collects real network datasets used in published papers in the field of complex networks, and provides a simple Python code …☆34Updated 11 months ago
- ☆111Updated 2 years ago
- Python toolbox to evaluate graph vulnerability and robustness (CIKM 2021)☆162Updated 2 years ago
- ☆24Updated 3 years ago
- DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)☆15Updated 3 years ago
- Implementation of "Overlapping Community Detection with Graph Neural Networks"☆169Updated 5 years ago
- DrBC: A novel graph neural network approach to identify high Betweenness Centraliy (BC) nodes ( CIKM'19 )☆33Updated 4 years ago
- Transportation data online prediction☆50Updated 4 years ago
- ☆160Updated last year
- Graph Neural Networks for Community Detection☆64Updated 5 years ago