A New Centrality Measure for Influence Maximization in Social Networks
The paper addresses the problem of finding top k influential nodes in large scale directed social networks. We propose a centrality measure for independent cascade model, which is based on diffusion probability (or propagation probability) and degree centrality. We use (i) centrality based heuristics with the proposed centrality measure to get k influential individuals. We have also found the same using (ii) high degree heuristics and (iii) degree discount heuristics. A Monte-Carlo simulation has been conducted with top k-nodes found through different methods. The result of simulation indicates, k nodes obtained through (i) significantly outperform those obtain by (ii) and (iii). We further verify the differences statistically using T-Test and found the minimum significance level (p-value) when k > 5 is 0.022 compare with (ii) and 0.015 when comparing with (iii) for twitter data.
KeywordsSocial Network Maximization Problem Centrality Measure Heuristic Model High Degree Node
- 2.Choudhury, M.D., Sundaram, H., John, A., Seligmann, D.D., Kelliher, A.: “birds of a feather”: Does user homophily impact information diffusion in social media? CoRR abs/1006.1702 (2010)Google Scholar
- 4.Estevez, P.a., Vera, P., Saito, K.: Selecting the Most Influential Nodes in Social Networks. In: International Joint Conference on Neural Networks, August 2007, pp. 2397–2402 (2007)Google Scholar
- 5.Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 2003, p. 137. ACM Press, New York (2003)Google Scholar
- 7.MacKay, D.: Introduction to monte carlo methods. Learning in graphical models (1), 175–204 (1998)Google Scholar
- 10.Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 2002, p. 61 (2002)Google Scholar