An upper bound based greedy algorithm for mining top-k influential nodes in social networks.
Chuan ZhouPeng ZhangJing GuoLi GuoPublished in: WWW (Companion Volume) (2014)
Keyphrases
- greedy algorithm
- upper bound
- influential nodes
- influence maximization
- worst case
- social networks
- lower bound
- influence spread
- social network analysis
- information diffusion
- objective function
- diffusion models
- greedy algorithms
- viral marketing
- knapsack problem
- greedy strategy
- np hard
- dynamic programming
- social interaction
- approximation algorithms