Abstract
This paper studies the top-k influence maximization problem together with network dynamics. We propose an incremental update framework that takes advantage of smoothness of network changes. Experiments show that the proposed method outperforms the straightforward solution by a wide margin.
This work is supported in part by grant 61432008 from the National Natural Science Foundation of China, and in part by grant MYRG109(Y1-L3)-FST12-ULH and MYRG2014-00106-FST from UMAC RC.
H. Wang—Part of the work was done when this author was a PhD student at the University of Hong Kong.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, Y.-C., Peng, W.-C., Lee, S.-Y.: Efficient algorithms for influence maximization in social networks. KAIS 33(3), 577–601 (2012)
Cho, E., Myers, S.A., Leskovec, J.: Friendship and mobility: user movement in location-based social networks. In: KDD (2011)
Cohen, E.: Size-estimation framework with applications to transitive closure and reachability. JCSS 55(3), 441–453 (1997)
Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J.M., Glance, N.S.: Cost-effective outbreak detection in networks. In: KDD (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, H., Pan, N., Hou, U.L., Zhan, B., Gong, Z. (2015). On Dynamic Top-k Influence Maximization. In: Dong, X., Yu, X., Li, J., Sun, Y. (eds) Web-Age Information Management. WAIM 2015. Lecture Notes in Computer Science(), vol 9098. Springer, Cham. https://doi.org/10.1007/978-3-319-21042-1_60
Download citation
DOI: https://doi.org/10.1007/978-3-319-21042-1_60
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21041-4
Online ISBN: 978-3-319-21042-1
eBook Packages: Computer ScienceComputer Science (R0)