Abstract
In a social network, when the number of users discussing a topic exceeds a critical threshold, the topic will have a serious impact on the corresponding community. In this paper, we consider the problem of finding the minimum set of initial users of a topic to propagate a message so that, with a given guaranteed probability, the number of users discussing the topic would reach the critical threshold. This study is formally called the Minimum-Cost Information Dissemination (MCID) problem in our research. Different from the influence maximization problem, the MCID problem attempts to achieve influence maximization from the minimum cost perspective. To tackle the problem, we proposed a novel method based on h-hop independent set, HISS. Based on the independent set, HISS guarantees that the source nodes are sparsely distributed in the network. In addition, since HISS utilizes h-hop graph transformation, it can reduce the number of source nodes and avoid the scenarios in which the source nodes have common neighbors. The proposed method was evaluated with two real networks. The experimental results indicate that our proposed algorithm outperforms the state-of-the-art algorithms.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: KDD 2003, pp. 137–146 (2003)
Domingos, P., Richardson, M.: Mining the network value of customers. In: KDD 2001 pp. 61–70 (2001)
Xu, W., Lu, Z., Wu, W., Chen, Z.: A novel approach to online social influence maximization. Soc. Netw. Anal. Min. 4, 153 (2014)
Goyal, A., Bonchi, F., Lakshmanan, L.V., Venkatasubramanian, S.: On minimizing budget and time in influence propagation over social networks. In: Social Network Analysis and Mining, pp. 1–14 (2012)
Zhang, P., Chen, W., Sun, X., Wang, Y., Zhang, J.: Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network. In: KDD 2014, pp. 1306–1315 (2014)
Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: KDD 2009, pp.199–208 (2009)
Li, S., Zhu, Y., Li, D., Kim, D., Ma, H., Huang, H.: Influence maximization in social networks with user attitude modification. In: IEEE ICC, pp. 3913–3918 (2014)
Nguyen, D.T., Das,S., Thai, M.T.: Influence maximization in multiple online social networks. In: Global Communications Conference (GLOBECOM), pp. 3060–3065 (2013)
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., Van Briesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: KDD 2007, pp. 420–429 (2007)
Leskovec, J.: Wiki-vote social network. http://snap.stanford.edu/data/wi-ki-Vote.html
Zhang, Y., Gu, Q., Zheng, J.: Estimate on expectation for influence maximization in social networks. In: PAKDD 2010, pp. 99–106 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Deng, D., Du, H., Jia, X., Ye, Q. (2015). Minimum-Cost Information Dissemination in Social Networks. In: Xu, K., Zhu, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2015. Lecture Notes in Computer Science(), vol 9204. Springer, Cham. https://doi.org/10.1007/978-3-319-21837-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-21837-3_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21836-6
Online ISBN: 978-3-319-21837-3
eBook Packages: Computer ScienceComputer Science (R0)