Abstract
As E-marketing based on online social networks develops fast, the influence maximization problem draws attention from both academics and industries. This problem focuses on which subset of users should be selected as seed users so that based on the specific information diffusion model, the advertising companies can maximize word-of-mouth effect. Exisiting related work assume there is no cost to choose these seed users, or the cost is given in the problem setting. While in real situation, it is crucial but difficult to elicit users’ true attitude over being seeds. Moreover, we notice “threshold” as users’ private information in the Linear Threshold model can represent individual’s preference. Thus we propose a new model in which users, willing to be seeds, are asked to report their threshold information. The method called TREE is designed to solve this model, especially the payment mechanism should make sure all users tell truth. Experiments on real social network data to verify the effectiveness of TREE.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
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. ACM (2010)
Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE 10th International Conference on Data Mining (ICDM), pp. 88–97. IEEE (2010)
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)
Goyal, A., Lu, W., Lakshmanan, L.V.: Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 211–220. IEEE (2011)
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)
Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259–271. Springer, Heidelberg (2006). https://doi.org/10.1007/11871637_27
Krause, A., Guestrin, C.: A note on the budgeted maximization of submodular functions (2005)
Granovetter, M.: Threshold models of collective behavior. Am. J. Sociolo. 83(6), 1420–1443 (1978)
Mohite, M., Narahari, Y.: Incentive compatible influence maximization in social networks and application to viral marketing. arXiv preprint arXiv:1102.0918 (2011)
Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265–294 (1978)
P. Domingos, M. Richardson: 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)
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)
Singer,Y.: How to win friends and influence people, truthfully: in-fluence maximization mechanisms for social networks. In: Proceedings of the 5th ACM International Conference on Web Search and Data Mining, pp. 733–742 (2012)
Acknowledgement
This work was supported by the National Natural Science Foundation of China (NSFC, project 61902152, 61972182) and the Natural Science Foundation of Jiangsu Province (BK20180600).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Hao, W., Zhan, Q., Liu, Y. (2021). Influence Maximization Based on True Threshold in Social Networks. In: Fu, W., Xu, Y., Wang, SH., Zhang, Y. (eds) Multimedia Technology and Enhanced Learning. ICMTEL 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 387. Springer, Cham. https://doi.org/10.1007/978-3-030-82562-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-82562-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-82561-4
Online ISBN: 978-3-030-82562-1
eBook Packages: Computer ScienceComputer Science (R0)