Abstract
Influence maximization is an issue to find a K-node seed set of influential nodes that can maximize the number of influenced nodes in a social network, where K is a given parameter. A greedy algorithm can approximate the optimal result within a factor of \((1-1/e-\varepsilon )\), but it is computationally expensive. The degree-based heuristic algorithm is simple, but it is of unstable accuracy without considering propagation characteristics. To address these issues, a k-shell decomposition algorithm(KDA) for influence maximization is proposed under the linear threshold model in this paper. First, we present an improved greedy algorithm(IGA) by discarding some unnecessary calculations. Secondly, the network is decomposed using a k-shell decomposition method to calculate the potential influence of nodes. Finally the nodes with the largest potential influence and the nodes with the largest marginal influence degrees are selected at each step to compose a K-node seed set. The experimental results show that KDA can achieve both high efficiency and high accuracy, compared with the existing representative algorithms.
Keywords
Download to read the full chapter text
Chapter PDF
References
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66 (2001)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146 (2003)
Goldenberg, J., Libai, B., Muller, E.: Talk of the Network: A complex systems look at the underlying process of Word-of-Mouth. Marketing Letters 12(3), 211–223 (2001)
Goldenberg, J., Libai, B., Muller, E.: Using complex systems analysis to advance marketing theory development. Academy of Marketing Science Review 9(3), 1–18 (2001)
Granovetter, M.: Threshold models of collective behavior. American journal of sociology 83(6), 1420–1443 (1978)
Kim, J., Lee, W., Hwanjo, Y.: CT-IC: Continuously activated and time-restricted independent cascade model for viral marketing. Knowledge-Based Systems 62, 57–68 (2014)
He, X., Song, G., Chen, W., et al.: Influence blocking maxmization in social networks under the competive linear threshold model. In: SDM, pp. 463–474 (2012)
Leskovec, J., Krause, A., Guestrin, C., et al.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 420–429 (2007)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: CELF++: optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, pp. 47–48. ACM (2011)
Zhou, C., Zhang, P., Guo, J., et al.: UBLF: an upper bound based approach to discover influential nodes in social networks. In: 13th International Conference on Data Mining, pp. 907–916. IEEE (2013)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029–1038 (2010)
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 (2009)
Jiang, Q., Song, G., Cong, G., et al.: Simulated annealing based influence maximization in social networks. In: Proceedings of the 15th AAAI Conference on Artificial Intelligence, pp. 127–132 (2011)
Borgs, C., Brautbar, M., Chayes, J., et al.: Maximizing social influence in nearly optimal time. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 946–957 (2014)
Xu, W., Lu, Z., Wu, W., et al.: A novel approach to online social influence maximization. Social Network Analysis and Mining 4(1), 1–13 (2014)
Cheng, S.Q., Shen, H.W., Huang, J.M., et al.: IMRank: influence maximization via finding self-consistent ranking (2014). arXiv preprint arXiv, 1402.3939
Zhang, X., Zhu, J., Wang, Q., et al.: Identifying influential nodes in complex networks with community structure. Knowledge-based Systems 42, 74–84 (2013)
Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 10th International Conference on Data Mining, ICDM, pp. 88–97 (2010)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 11th International Conference on Data Mining, ICDM, pp. 211–220 (2011)
Ben-Zwi, O., Hermelin, D., Lokshtanov, D., et al.: An exact almost optimal algorithm for target set selection in social networks. In: Proceedings of the 10th ACM conference on Electronic commerce, pp. 355–362. ACM (2009)
Bhagat, S., Goyal, A., Lakshmanan, L.V.S.: Maximizing product adoption in social networks. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 603–612. ACM (2012)
Goyal, A., Bonchi, F., Lakshmanan, L.V.S., et al.: On minimizing budget and time in influence propagation over social networks. Social Network Analysis and Mining 3(2), 179–192 (2013)
Narayanam, R., Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering 8(1), 1–18 (2011)
Lu, Z., Fan, L., Wu, W., et al.: Efficient influence spread estimation for influence maximization under the linear threshold model. Computational Social Networks 1(1), 1–19 (2014)
Freeman, L.C.: Centrality in social networks conceptual clarification. Social networks 1(3), 215–239 (1979)
Brin, S., Page, L.: The anatomy of a larege-scale hypertextual web search engine. Computer networks 30(1), 107–117 (1998)
Carmi, S., Havlin, S., Kirkpatrick, S., et al.: A model of Internet topology using k-shell decomposition. Proceedings of the National Academy of Sciences 104(27), 11150–11154 (2007)
Pittel, B., Spencer, J.H., Wormald, N.C.: Sudden emergence of a giant k-core in a random graph. Journal of Combinatorial Theory Series B 67(1), 111–151 (1996)
Kitsak, M., Gallos, L.K., Havlin, S., et al.: Identification of influential spreaders in complex networks. Nat. Phys. 6, 888–893 (2010)
Wang, Y., Feng, X.: A potential-based node selection strategy for influence maximization in a social network. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol. 5678, pp. 350–361. Springer, Heidelberg (2009)
Guimera, R., Danon, L., Diaz-Guilera, A., et al.: Self-similar community structure in a network of human interactions. Physical Review E 68, 065103 (2003)
Sun, S., Ling, L., Zhang, N., et al.: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Research 31(9), 2443–2450 (2003)
Boguna, M., Pastor-Satorras, R., Diaz-Guilera, A., et al.: Models of social networks based on social distance attachment. Physical Review E 70, 056122 (2004)
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
Zhao, Q., Lu, H., Gan, Z., Ma, X. (2015). A K-shell Decomposition Based Algorithm for Influence Maximization. In: Cimiano, P., Frasincar, F., Houben, GJ., Schwabe, D. (eds) Engineering the Web in the Big Data Era. ICWE 2015. Lecture Notes in Computer Science(), vol 9114. Springer, Cham. https://doi.org/10.1007/978-3-319-19890-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-19890-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19889-7
Online ISBN: 978-3-319-19890-3
eBook Packages: Computer ScienceComputer Science (R0)