Browse > Article
http://dx.doi.org/10.7840/kics.2016.41.10.1244

Diffusion-Based Influence Maximization Method for Social Network  

Nguyen, Tri-Hai (Soongsil University, School of Electronic Engineering)
Yoo, Myungsik (Soongsil University, School of Electronic Engineering)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.41, no.10, 2016 , pp. 1244-1246 More about this Journal
Abstract
Influence maximization problem is to select seed node set, which maximizes information spread in social networks. Greedy algorithm shows an optimum solution, but has a high computational cost. A few heuristic algorithms were proposed to reduce the complexity, but their performance in influence maximization is limited. In this paper, we propose general degree discount algorithm, and show that it has better performance while keeping complexity low.
Keywords
Social Network; Influence; Diffusion; Greedy; Heuristic;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Y. Kim and G. Park, "Topic sensitive_social relation rank algorithm for efficient social search," J. KICS, vol. 38, no. 5, pp. 385-393, 2013.
2 D. Kempe, J. Kleinberg, and E. Tardos, "Maximizing the spread of influence through a social network," in Proc. 9th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, pp. 137-146, 2003.
3 M. Kimura and K. Saito, "Tractable models for information diffusion in social networks," in Knowledge Discovery in Databases: PKDD, Springer Berlin Heidelberg, pp. 259-271, 2006.
4 W. Chen, Y. Wang, and S. Siyu, "Efficient influence maximization in social networks," in Proc. 15th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 199-208, 2009.
5 J. Leskovec, Stanford Large Network Dataset Collection - Social networks, Available: https://snap.stanford.edu/data/