An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks 


Vol. 38,  No. 6, pp. 485-491, Jun.  2013


PDF
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

N. D. Linh, W. Quan, J. Hwang, M. Yoo, "An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 485-491, 2013. DOI: .

[ACM Style]

Nguyen Duy Linh, Wenji Quan, Junho Hwang, and Myungsik Yoo. 2013. An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks. The Journal of Korean Institute of Communications and Information Sciences, 38, 6, (2013), 485-491. DOI: .

[KICS Style]

Nguyen Duy Linh, Wenji Quan, Junho Hwang, Myungsik Yoo, "An Information Diffusion Maximization Algorithm Based on Diffusion Probability and Node Degree for Social Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 38, no. 6, pp. 485-491, 6. 2013.