JOURNAL BROWSE
Search
Advanced SearchSearch Tips
An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks
Linh, Nguyen Duy; Quan, Wenji; Hwang, Junho; Yoo, Myungsik;
  PDF(new window)
 Abstract
Recently, with the proliferation of social network services, users and many companies hope that their information spread more faster. In order to study the information diffusion in the social networks, many algorithms such as greedy algorithm and heuristic algorithm have been proposed. However, the greedy algorithm is too complicated to use in real-life social network, and the heuristic algorithms have been studied under the uniform distribution of diffusion probability, which is different from the real social network property. In this paper, we propose an heuristic information diffusion maximization algorithm based on diffusion probability and node degree. For performance evaluation, we use real social network database, and it is verified that our proposed algorithm activates more active nodes than existing algorithms, which enables faster and wider information diffusion.
 Keywords
Social Network;Influence;Diffusion;Heuristic Algorithm;Greedy Algorithm;
 Language
Korean
 Cited by
 References
1.
J.-W. Byeon, J.-M. Song, and D.-B. Son, "Design business model creating social network and 'self-employed' company," J. Korean Soc. Design Sci., vol. 24, no. 3, pp. 195-206, Aug. 2011.

2.
K.-S. Seol, J.-D. Kim, H.-N. Shim, and D.-K. Baik, "Intimacy measurement method and experiment between social network service users," J. Korean Inform. Sci. Soc., vol. 39, no. 4, pp. 335-341, Aug. 2012.

3.
S. Knopper, On the Charts: Psy's 'Gentleman' Earns Youtube Love, Retrieved Apr., 17, 2013, from http://www.rollingstone.com

4.
M. Granovetter, "Threshold model of collective behavior," The Amer. J. Sociol., vol. 83, no. 6, pp. 1420-1443, May 1978. crossref(new window)

5.
D. J. Watts, "A simple model of global cascades on random networks," in Proc. Nat. Academy of Sci. U.S.A (PNAS), vol. 99, no. 9, pp. 5766-5771, April 2002. crossref(new window)

6.
J. Goldenberg, B. Libai, and E. Muller, "Using complex systems analysis to advance marketing theory development: modeling heterogeneity effects on new product growth through stochastic cellular automata," Academy of Marketing Sci. Review, vol. 2001, no. 9, pp. 1-19, 2001.

7.
M. Richardson and P. Domingos, "Mining knowledge-sharing sites for viral marketing," in Proc. 8th ACM Int. Conf. Knowledge Discovery and Data Mining (ACM SIGKDD), pp. 61-70, New York, U.S.A., August 2002.

8.
D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proc. 9th ACM Int. Conf. Knowledge Discovery and Data Mining (ACM SIGLKDD), pp. 137-146, New York, U.S.A., August 2003..

9.
W. Chen, Y. Wang, and S. Yang, "Efficient influence maximization in social networks," in Proc. 15th ACM Int. Conf. Knowledge Discovery and Data Mining (ACM SIGKDD), pp. 199-208, New York, U.S.A., June 2009.

10.
M. E. J. Newman, "The structure and function of complex networks," Soc. Ind. Appl. Math., vol. 45, no. 2, pp. 167-256, Mar. 2003.

11.
S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. U. Hwang, "Complex networks: structure and dynamics," Physics Reports, vol. 424, no. 2006, pp. 175-308, Jan. 2006. crossref(new window)