On influential nodes tracking in dynamic social networks

SIAM International Conference on Data Mining 2015, SDM 2015

Volumn , Issue , 2015, Pages 613-621

  Chen, Xiaodong ^a   Song, Guojie ^a   He, Xinran ^b   Xie, Kunqing ^a  

^a PEKING UNIVERSITY   (China)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCE; DATA MINING; MARKETING;

DYNAMIC SOCIAL NETWORKS; EMPIRICAL EXPERIMENTS; INFLUENCE MAXIMIZATIONS; LARGE-SCALE DYNAMICS; MARKETING CAMPAIGN; NETWORK STRUCTURES; SOCIAL NETWORK STRUCTURES; WORD-OF-MOUTH EFFECTS;

SPACE DIVISION MULTIPLE ACCESS;

EID: 84961899473     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611974010.69     Document Type: Conference Paper

References (15)

1. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of inffluence through a social network, " in KDD, 2003, pp. 137-146.
2. M. Kimura and K. Saito, "Tractable models for information diffusion in social networks, " in PKDD, 2006, pp. 259-271.
3. W.Yu, G.Cong, G.Song, and K.Xie, "Community-based greedy algorithm for mining top-k influential nodes in mobile social networks, " in KDD, 2010, pp. 1039-1048.
4. W.Chen, C.Wang, and Y.Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks, " in KDD, 2010, pp. 1029-1038.
5. J. Leskovec, J. Kleinberg, and C. Faloutsos, "Graphs over time: densification laws, shrinking diameters and possible explanations, " in KDD, 2005, pp. 177-187.
6. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins, "Microscopic evolution of social networks, " in KDD, 2008, pp. 462-470.
7. C. Zhou, P. Zhang, J. Guo, X. Zhu, and L. Guo, "Ublf: An upper bound based approach to discover influential nodes in social networks, " in ICDM, 2013.
8. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance, "Cost-effective outbreak detection in networks." in KDD, 2007, pp. 420-429.
9. Y. Tang, X. Xiao, and Y. Shi, "Influence maximization: Near-optimal time complexity meets practical efficiency, " SIGMOD, 2014.
10. C. Borgs, M. Brautbar, J. T. Chayes, and B. Lucier, "Influence maximization in social networks: Towards an optimal algorithmic solution, " SODA, 2014.
11. Q. Jiang, G. Song, G. Cong, Y. Wang, W. Si, and K. Xie, "Simulated annealing based influence maximization in social network, " in AAAI, 2011.
12. K. Jung, W. Heo, and W. Chen, "Irie: Scalable and robust influence maximization in social networks, " in ICDM, 2012, pp. 918-923.
13. C. C. Aggarwal, S. Lin, and S. Y. Philip, "On influential node discovery in dynamic social networks." in SDM, 2012, pp. 636-647.
14. H. Zhuang, Y. Sun, J. Tang, J. Zhang, and X. Sun, "Influence maximization in dynamic social networks, " in ICDM, 2013, pp. 1313-1318.
15. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher, "An analysis of approximations for maximizing submodular set functions, " Mathematical Programming, vol. 14, no. 1, pp. 265-294, 1978.