On budgeted influence maximization in social networks

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 6, 2013, Pages 1084-1094

  Nguyen, Huy ^a   Zheng, Rong ^b  

^a University of Houston   (United States)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

belief propagation; Budgeted influence maximization; information diffusion; social network

Indexed keywords

APPROXIMATION RATIOS; BELIEF PROPAGATION; INFLUENCE MAXIMIZATIONS; INFORMATION DIFFUSION; MARGINAL PROBABILITY; NETWORK PARAMETERS; SOCIAL NETWORKS; SYNTHETIC DATASETS;

APPROXIMATION ALGORITHMS; BAYESIAN NETWORKS; COMPLEX NETWORKS; COST ACCOUNTING; HEURISTIC ALGORITHMS; SOCIAL NETWORKING (ONLINE);

BUDGET CONTROL;

EID: 84878122058     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130610     Document Type: Article

References (28)

1. P. Domingos and M. Richardson, "Mining the network value of customers," in Proc. seventh ACM SIGKDD KDD '01. NewYork,NY, USA: ACM, 2001, pp. 57-66.
2. M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing," in Proc. eighth ACM SIGKDD KDD '02. NewYork, NY, USA: ACM, 2002, pp. 61-70.
3. D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proc. KDD '03. NewYork, NY, USA: ACM, 2003, pp. 137-146.
4. W. Chen, C. Wang, and Y. Wang, "Scalable influence maximization for prevalent viral marketing in large-scale social networks," in Proc. KDD '10. New York, NY, USA: ACM, 2010, pp. 1029-1038.
5. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance, "Cost-effective outbreak detection in networks," in Proc. 13th ACM SIGKDD KDD '07. New York, NY, USA: ACM, 2007, pp. 420-429. (Pubitemid 350229228)
6. W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proc. KDD '09. New York, NY, USA: ACM, 2009, pp. 199-208.
7. W. Chen, Y. Yuan, and L. Zhang, "Scalable influence maximization in social networks under the linear threshold model," in Proc. 2010 IEEE ICDM '10, 2010, pp. 88-97.
8. D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, and C. Faloutsos, "Epidemic thresholds in real networks," ACM Trans. Inf. Syst. Secur., vol. 10, no. 4, pp. 1:1-1:26, Jan. 2008.
9. H. Tong, B. Prakash, C. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, and D. Chau, "On the vulnerability of large graphs," in IEEE 10th ICDM, dec. 2010, pp. 1091-1096.
10. B. A. Prakash, H. Tong, N. Valler, M. Faloutsos, and C. Faloutsos, "Virus propagation on time-varying networks: theory and immunization algorithms," in Proc. 2010 ECML PKDD: Part III. Berlin, Heidelberg: Springer-Verlag, 2010, pp. 99-114.
11. H. Nguyen and R. Zheng, "Influence spread in large-scale social networks-a belief propagation approach," in Proc. ECML PKDD'12. Berlin, Heidelberg: Springer-Verlag, 2012, pp. 515-530.
12. J. Goldenberg, B. Libai, and E. Muller, "Talk of the network: A complex systems look at the underlying process of word-of-mouth," Marketing Letters, vol. 12, pp. 211-223, 2001. (Pubitemid 33686497)
13. S. Khuller, A. Moss, and J. S. Naor, "The budgeted maximum coverage problem," in Infor. Proc. Letters, vol. 70, no. 1, pp. 39-45, 1999.
14. C. Chekuri and A. Kumar, "Maximum coverage problem with group budget constraints and applications," in Proc. 7th APPROX, 2004, pp. 72-83.
15. J. S. Yedidia, W. T. Freeman, and Y. Weiss, Understanding belief propagation and its generalizations. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 2003, pp. 239-269.
16. S. L. Lauritzen and D. J. Spiegelhalter, "Local Computations with Probabilities on Graphical Structures and Their Application to Expert Systems," J. Royal Statistical Society. Series B (Methodological), vol. 50, no. 2, 1988.
17. K. P. Murphy, Y. Weiss, and M. I. Jordan, "Loopy Belief Propagation for Approximate Inference: An Empirical Study," in In Proc. Uncertainty in AI, 1999, pp. 467-475.
18. B. J. Frey, R. Koetter, and N. Petrovic, Very loopy belief propagation for unwrapping phase images. MIT Press, 2001, vol. 14, p. 737743.
19. R. McEliece, D. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of pearl's ldquo;belief propagation rdquo; algorithm," in J. Sel. Areas Commun., vol. 16, no. 2, pp. 140-152, feb 1998. (Pubitemid 128570649)
20. M. Kimura and K. Saito, "Tractable models for information diffusion in social networks," in Knowledge Discovery in Databases: PKDD 2006, 2006, vol. 4213, pp. 259-271. (Pubitemid 44617729)
21. S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine," Comput. Netw. ISDN Syst., vol. 30, pp. 107-117, April 1998.
22. L. Freeman, "Centrality in social networks conceptual clarification," Social Networks, vol. 1, no. 3, pp. 215-239, 1979.
23. J. M. Mooij, "libDAI: A free and open source C++ library for discrete approximate inference in graphical models," J. Machine Learning Research, vol. 11, pp. 2169-2173, Aug. 2010.
24. Boost c++ libraries. [Online]. Available: http://http://www.boost.org/
25. J. Leskovec. Stanford large network dataset collection. [Online]. Available: http://snap.stanford.edu/data/
26. I. Wiki. Social network generation. [Online]. Available: http://www.infovis-wiki.net/index.php/Social Network Generation
27. L. Dignan. (2006) Dynamic graph generator. [Online]. Available: http://digg.cs.tufts.edu/
28. A. Clauset, C. R. Shalizi, and M. E. J. Newman, "Power-law distributions in empirical data," SIAM Rev., vol. 51, no. 4, pp. 661-703, Nov. 2009.