Abstract
This paper focused on seeking a new heuristic algorithm for the influence maximization problem in complex social network, that is, how to effectively select a subset of individuals to trigger a large cascade of further adoptions of new behavior under certain influence cascade models. In literature, degree and other centrality-based heuristics are commonly used to estimate the influential power of nodes in social networks. One of major issues with degree-based heuristics is that they are derived from the uniform IC (independent cascade) model, where propagation probabilities on all edges are the same, which is rarely the case in reality. Based on the general weighted cascade model (WC), this paper proposes Pagerank-like heuristic scheme, PRDiscount, in which discounting the influence power is explicitly adopted to alleviate the “overlapping effect” occurred in behavior diffusion. Then, we use both the artificially constructed social network graphs (with the features of power-law degree distribution and small-world characteristics) and the real-data traces of social networks to verify the performance of our proposal. Simulations illustrate that PRDiscount can advantage over the existing degree-based discount algorithm, DegreeDiscount, and achieve the comparable performance with greedy algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Domingos, M., Richardson, M.: Mining the Network Value of Customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) (2001)
Kempe, D., Kleinberg, J.M., Tardos, E.: Maximizing the Spread of Influence Through a Social Network. In: Proceedings of the 9th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2003)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.S.: Cost-effective Outbreak Detection in Networks. In: Proceedings of the 13th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2007)
Narayanam, R., Narahari, Y.: A Shapley Value based Approach to Discover Influential Nodes in Social Networks. IEEE TASE 8(1), 130–147 (2011)
Han, B., Srinivasan, A.: Your Friends Have More Friends Than You Do: Identifying Influential Mobile Users Through Random Walks. In: Proceedings of the 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC) (2012)
Chen, W., Wang, Y.: Yang. S.: Efficient Influence Maximization in Social Networks. In: Proceedings of KDD (2009)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order To the Web, Technical report, Stanford Digital Library Technologies Project (1998)
Watts, D.J., Strogatz, S.H.: Collective Dynamics of ‘Small-World’ Networks. Nature 393(6684) (1998)
Barabasi, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Jackson, M.O., Rogers, B.W.: Meeting Strangers and Friends of Friends: How Random are Socially Generated Networks? American Economic Review 97(3) (2007)
Adamic, L.A., Glance, N.: The Political Blogosphere and the 2004 US Election. In: Proceedings of WWW Workshop on the Weblogging Ecosystem (2005)
Newman, M.E.J.: Finding Community Structure in Networks Using the Eigenvectors of Matrices. Physical Review E74(036104) (2006)
Latora, V., Marchiori, M.: Economic Small-World Behavior in Weighted Networks. Eur. Phys. J. B 32(2), 249–263 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Y., Zhang, B., Vasilakos, A.V., Ma, J. (2014). PRDiscount: A Heuristic Scheme of Initial Seeds Selection for Diffusion Maximization in Social Networks. In: Huang, DS., Bevilacqua, V., Premaratne, P. (eds) Intelligent Computing Theory. ICIC 2014. Lecture Notes in Computer Science, vol 8588. Springer, Cham. https://doi.org/10.1007/978-3-319-09333-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-09333-8_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09332-1
Online ISBN: 978-3-319-09333-8
eBook Packages: Computer ScienceComputer Science (R0)