Influence Maximization in Near-Linear Time: A Martingale Approach

ACM SIGMOD Conference, pp. 1539-1554, 2015.

Cited by: 463|Views329
EI

Abstract:

Given a social network G and a positive integer k, the influence maximization problem asks for k nodes (in G) whose adoptions of a certain idea or product can trigger the largest expected number of follow-up adoptions by the remaining nodes. This problem has been extensively studied in the literature, and the state-of-the-art technique ru...More

Code:

Data:

Your rating :
0

 

Tags
Comments