Abstract
Influence Maximization is the problem of selecting a small set of seed users in a social network to maximize the spread of influence. Traditional solutions are mainly divided into two directions. The one is greedy-based methods and the other is heuristics-based methods. The greedy-based methods can effectively estimate influence spread using thousands of Monte-Carlo simulations. However, the computational cost of simulation is extremely expensive so that they are not scalable to large networks. The heuristics-based methods, estimating influence spread according to heuristic strategies, have low computational cost but without theoretical guarantees. In order to improve both performance and effectiveness, in this paper we propose a greedy-based algorithm, named UserGreedy. In UserGreedy, we first propose a novel concept called Activation Set, which is defined as a set of users that can be activated by a seed user with a certain probability under the most standard and popular independent cascade (IC) model. Based on the computation of such probabilities, we can directly estimate the influence spread without the expensive simulation process. We then design an influence spread function based on the the Activation Set and mathematically prove that it has the property of monotonicity and submodularity, which provides theoretical guarantee for the UserGreedy algorithm. Besides, we also propose an efficient method to obtain the Activation Set and hence implement the UserGreedy algorithm. Experiments on real-world social networks demonstrate that our algorithm is much faster than existing greedy-based algorithms and outperforms the state-of-art heuristics-based algorithms in terms of effectiveness.
This work was partially supported by NSFC (No.61272374, 61300190), SRFDP (No.20120041110046) and Key Project of Chinese Ministry of Education (No.313011).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)
Chen, W., Lu, W., Zhang, N.: Time-critical influence maximization in social networks with time-delayed diffusion process. In: AAAI, pp. 592–598 (2012)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp. 1029–1038 (2010)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD, pp. 199–208 (2009)
Cheng, S., Shen, H., Huang, J., Zhang, G., Cheng, X.: Staticgreedy: solving the scalability-accuracy dilemma in influence maximization. In: CIKM, pp. 509–518 (2013)
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD, pp. 57–66 (2001)
Feng, S., Chen, X., Cong, G., Zeng, Y., Chee, Y.M., Xiang, Y.: Influence maximization with novelty decay in social networks. In: AAAI, pp. 37–43 (2014)
He, X., Song, G., Chen, W., Jiang, Q.: Influence blocking maximization in social networks under the competitive linear threshold model. In: SDM, pp. 463–474 (2012)
Jung, K., Heo, W., Chen, W.: Irie: Scalable and robust influence maximization in social networks. In: ICDM, pp. 918–923 (2012)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD, pp. 137–146 (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD, pp. 420–429 (2007)
Li, H., Bhowmick, S.S., Sun, A.: Cinema: conformity-aware greedy algorithm for influence maximization in online social networks. In: ICDT, pp. 323–334 (2013)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14(1), 265–294 (1978)
Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD, pp. 61–70 (2002)
Rodriguez, M.G., Schölkopf, B.: Influence maximization in continuous time diffusion networks. In: ICML, pp. 313–320 (2012)
Wang, Y., Cong, G., Song, G., Xie, K.: Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: KDD, pp. 1039–1048 (2010)
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
Liang, W., Shen, C., Zhang, X. (2015). UserGreedy: Exploiting the Activation Set to Solve Influence Maximization Problem. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-25255-1_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25254-4
Online ISBN: 978-3-319-25255-1
eBook Packages: Computer ScienceComputer Science (R0)