Abstract
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.
Chapter PDF
References
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 199–208. ACM Press, New York (2009)
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)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 57–66. ACM Press, New York (2001)
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)
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)
López-Pintado, D.: Diffusion in complex social networks. Games and Economic Behavior 62(2), 573–590 (2008)
MacKay, D.: Introduction to monte carlo methods. Learning in graphical models (1), 175–204 (1998)
Montgomery, D., Runger, G.: Applied Statistics And Probability For Engineers. Wiley, India (2007)
Nieminen, J.: On the Centrality in a Graph. Scandinavian Journal of Psychology 15, 332–336 (1974)
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)
Tang, J., Yao, L., Zhang, D., Zhang, J.: A combination approach to web user profiling. ACM Transactions on Knowledge Discovery from Data V(March), 1–38 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kundu, S., Murthy, C.A., Pal, S.K. (2011). A New Centrality Measure for Influence Maximization in Social Networks. In: Kuznetsov, S.O., Mandal, D.P., Kundu, M.K., Pal, S.K. (eds) Pattern Recognition and Machine Intelligence. PReMI 2011. Lecture Notes in Computer Science, vol 6744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21786-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-21786-9_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21785-2
Online ISBN: 978-3-642-21786-9
eBook Packages: Computer ScienceComputer Science (R0)