Abstract
Social networking service (SNS) applications are changing the way information spreads in online communities. As real social relationships are projected into SNS applications, word of mouth has been an important factor in the information spreading processes of those applications. By assuming each user needs a cost to accept some specific information, this paper studies the initial “seed user” selection strategy to maximize information spreading in a social network with a cost budget. The main contributions of this paper are: 1) proposing a graphic SEIR model (gSEIR) by extending the epidemic compartmental model to simulate the dynamic information spreading process between individuals in the social network; 2) proposing a formal definition for the influence maximization problem with limit cost (IMLC) in social networks, and proving that this problem can be transformed to the weighted set-cover problem (WSCP) and thus is NP-Complete; 3) providing four different greedy algorithms to solve the IMLC problem; 4) proposing a heuristic algorithm based on the method of Lagrange multipliers (HILR) for the same problem; 5) providing two parts of experiments to test the proposed models and algorithms in this paper. In the first part, we verify that gSEIR can generate similar macro-behavior as an SIR model for the information spreading process in an online community by combining the micro-behaviors of all the users in that community, and that gSEIR can also simulate the dynamic change process of the statuses of all the individuals in the corresponding social networks during the information spreading process. In the second part, by applying the simulation result from gSEIR as the prediction of information spreading in the given social network, we test the effectiveness and efficiency of all provided algorithms to solve the influence maximization problem with cost limit. The result show that the heuristic algorithm HILR is the best for the IMLC problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Oded G, Weil D N. Population, technology and growth: from malthusian stagnation to the demographic transition and beyond. Amer Econ Rev, 2000, 90: 806–828
Murray J D. Mathematical Biology. 2nd ed. Berlin: Springer-Verlag, 1993
Gibson G J, Renshaw E. Estimating parameters in stochastic compartmental models using Markov chain Monte Carlo methods. IMA J Math Appl Med Biol, 1998, 15: 19–40
Khelil A, Becker C, Tian J. An epidemic model for information diffusion in MANETs. In: Proceedings of the 5th ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems. New York: ACM, 2002. 54–60
Jacquez J A, Simon C P. The stochastic SI model with recruitment and deaths I, comparison with the closed SIS model. Math Biosci, 1993, 117: 77–125
Lekone P E, Finkenstadt B F. Statistical inference in a stochastic epidemic SEIR model with control intervention: Ebola as a case study. Biometrics, 2006, 62: 1170–1177
Simon P L, Taylor M, Kiss I Z. Exact epidemic models on graphs using graph-automorphism driven lumping. J Math Biol, 2011, 62: 479–508
Adar E, Adamic L A. Tracking information epidemics in blogspace. In: Conference on Web Intelligence, Compiegne, 2005. 207–214
Saito K, Kimura M, Motoda H. Discovering influential nodes for SIS models in social networks. In: Proceedings of the 12th International Conference on Discovery Science. Berlin/Heidelberg: Springer-Verlag, 2009. 302–316
Anagnostopoulos A, Kumar R, Mahdian M. Influence and correlation in social networks. In: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2008. 7–15
Goyal A, Bonchi F, Lakshmanan L V S. Learning influence probabilities in social networks. In: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining. New York: ACM, 2010. 241–250
Tang J, Sun J M, Wang C, et al. Social influence analysis in large-scale networks. In: Proceeding of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2009. 807–816
Crandall D, Cosley D, Huttenlocher D, et al. Feedback effects between similarity and social influence in online communities. In: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2008. 160–168
Agarwal N, Liu H, Tang L, et al. Identifying the influential bloggers in a community. In: Proceedings of the 1st ACM International Conference on Web Search and Data Mining. New York: ACM, 2008. 207–217
Saito k, Nakano R, Kimura M. Prediction of information diffusion probabilities for independent cascade model. In: Proceedings of the 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems. Berlin/Heidelberg: Springer-Verlag, 2008. 67–75
Kleinberg J. Cascading behavior in networks: algorithmic and economic issues. In: Nisan N, Roughgarden T, Tardos E, et al., eds. Algorithmic Game Theory. Cambridge: Cambridge University Press, 2007
Saito K, Kimura M, Ohara K, et al. Selecting information diffusion models over social networks for behavioral analysis. In: Proceedings of the 2010 European Conference on Machine Learning and Knowledge Discovery in Databases. Berlin/Heidelberg: Springer-Verlag, 2010. 180–195
Kempe D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2003. 137–146
Chen W, Wang Y J, Yang S Y. Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Paris, 2009. 199–208
Vazirani V V. Approximate Algorithms. Springer, 2001
Karp R M. Reducibility among combinatorial problems. In: Miller R E, Thatcher J W, eds. Complexity of Computer Computations. New York: Plenum Press, 1972. 85–103
Caprara A, Fischetti M, Toth P. Algorithms for the set covering problem. Ann Oper Res, 1998, 92: 353–371
Gao B J, Ester M, Cai J Y, et al. The minimum consistent subset cover problem and its applications in data mining. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM, 2007. 310–319
Cormode G, Karloff H, Wirth A. Set cover algorithms for very large datasets. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. New York: ACM, 2010. 479–488
Blei D M, Ng A Y, Jordan M I. Latent Dirichlet allocation. J Mach Learn Res, 2003, 3: 993–1022
Fisher M L. The Lagrangian relaxation method for solving integer programming problems. Manage Sci, 1981, 27: 1–18
Weeks M R, Clair S, Borgatti S P, et al. Social networks of drug users in high-risk sites: finding the connections. AIDS Behav, 2002, 6: 193–206
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, Y., Huang, W., Zong, L. et al. Influence maximization with limit cost in social network. Sci. China Inf. Sci. 56, 1–14 (2013). https://doi.org/10.1007/s11432-013-4895-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-013-4895-5