hungnt55 / Stop-and-StareLinks
☆16Updated 7 years ago
Alternatives and similar repositories for Stop-and-Stare
Users that are interested in Stop-and-Stare are comparing it to the libraries listed below
Sorting:
- An influence maximization model based on various centrality measurement methods and IC model☆39Updated 6 years ago
- location-aware and topic-aware influence maximization☆10Updated 7 years ago
- ☆33Updated 2 years ago
- Dynamic graph/network dataset for dynamic graph/network embedding/representation☆36Updated 5 years ago
- ☆110Updated last year
- Source code for blog post at https://hautahi.com/im_greedycelf☆28Updated 5 years ago
- ☆31Updated 3 years ago
- DISCO: Influence Maximization Meets Graph Embedding and Deep Learning (a.k.a. PIANO)☆14Updated 3 years ago
- Simple and Fast State-of-Art Implementation of Influence Maximization Problem☆49Updated 6 years ago
- Testing link prediction using Node2Vec☆66Updated 7 years ago
- Algorithms for online influence maximization☆22Updated 8 years ago
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 7 months ago
- ☆10Updated 5 years ago
- ☆47Updated 5 years ago
- source code for signed graph attention networks (ICANN2019) & SDGNN (AAAI2021)☆55Updated last year
- Source Code for IJCAI 2018 paper "Scalable Multiplex Network Embedding"☆75Updated 5 years ago
- Implementation of the Influence Maximization Benchmarker (IMB)☆12Updated last year
- Top-K Influential Nodes in Social Networks: A Game Perspective (SIGIR'17)☆36Updated last year
- SIGMOD 2018: Online Processing Algorithms for Influence Maximization☆23Updated 6 years ago
- the Implementation of "Structural Deep Embedding for Hyper-Networks"(AAA20I8)☆46Updated 6 years ago
- this repository is a Influence Maximization tools kit, including Classic methods and algorithms for papers in recent years. Hopes to fill…☆25Updated 5 years ago
- This is the official implementation of "Arbitrary-Order Proximity Preserved Network Embedding"(KDD 2018).☆38Updated 6 years ago
- Code for Influence Maximization Problem☆29Updated 7 years ago
- The project is trying to find the most influential group of nodes in a huge social network.(SUSTech AI lab3)☆23Updated 6 years ago
- An implementation of paper: Dynamic Network Embedding: An Extended Approach for Skip-gram based Network Embedding☆17Updated 4 years ago
- Baselines for anchor link prediction (including MNA, PALE, IONE, FINAL, FRUI-P, CROSSMNA, REGAL, HYDRA, STUL)☆52Updated last year
- dynamic/temporal network embedding☆32Updated 6 years ago
- Implementation of two influence maximization algorithms : LDAG and NewGreedyIC (NGIC)☆12Updated 6 years ago
- Influence maximize problem with IC model (degree discount IC , new Greedy) and LT model (SIMPATH)☆27Updated 6 years ago
- Source code for CIKM 2019 paper "Temporal Network Embedding with Micro- and Macro-dynamics"☆37Updated 3 years ago