Abstract
Influence Maximization Problem aims at identifying a limited number of highly influential users who will be working for diffusion agents to maximize the influence. In case of Budgeted Influence Maximization (BIM), the users of the network have a cost and influential user selection needs to be done within a given budget. In case of Earned Benefit Maximization (EBM) Problem, a set of target users along with their benefit value is given and the aim is to choose highly influential users within an allocated budget to maximize the earned benefit. In this paper, we study the BIM and EBM Problem under the tag-specific edge probability setting, which means instead of a single edge probability a set of probability values (each one for a specific context e.g., ‘games,’ ‘academics,’ etc.) per edge is given. The aim is to identify the influential tags and users for maximizing the influence and earned benefit. Considering the realistic fact that different tags have a different impact on different communities of a social network, we propose two solution methodologies and one pruning technique. A detailed analysis of all the solution approaches has been done. An extensive set of experiments have been carried out with three benchmark datasets. From the experiments, we observe that the proposed solution approaches outperform baseline methods (e.g., random node-random tag, high-degree node–high-frequency tag, high-degree node–high-frequency tag with community). For the tag-based BIM Problem the improvement is upto \(8\%\) in terms of number of influenced nodes and for the tag-based EBM Problem the improvement is upto \(15\%\) in terms of earned benefit.
Similar content being viewed by others
References
Banerjee S, Jenamani M, Pratihar DK (2019a) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl
Banerjee S, Jenamani M, Pratihar DK (2019b) Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J Ambient Intell Hum Comput: 1–17
Banerjee S, Jenamani M, Pratihar DK (2020) Maximizing the earned benefit in an incentivized social networking environment: a community-based approach. J Ambient Intell Hum Comput 11(6):2539–2555
Banerjee S, Jenamani M, Pratihar DK (2020b) A survey on influence maximization in a social network. Knowl Inf Syst: 1–39
Banerjee S, Pal B, Jenamani M (2020c) Budgeted influence maximization with tags in social networks. In: International conference on web information systems engineering. Springer, pp 141–152
Bucur D, Iacca G (2016) Influence maximization in social networks with genetic algorithms. In: European conference on the applications of evolutionary computation. Springer, pp 379–392
Cai C, He R, McAuley J (2017) Spmc: socially-aware personalized markov chains for sparse sequential recommendation. Preprint arXiv:1708.04497
Cantador I, Brusilovsky P, Kuflik T (2011) 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec 2011). In: Proceedings of the 5th ACM conference on Recommender systems, ACM, New York, NY, USA, RecSys 2011
Chen T, Guo J, Wu W (2020) Adaptive multi-feature budgeted profit maximization in social networks. Preprint arXiv:2006.03222
Chen W, Wang C, Wang Y (2010) 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. ACM, pp 1029–1038
Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the 2011 siam international conference on data mining. SIAM, pp 379–390
Chen YC, Zhu WY, Peng WC, Lee WC, Lee SY (2014) Cim: community-based influence maximization in social networks. ACM Trans Intell Syst Technol (TIST) 5(2):25
Gao C, Gu S, Yang R, Du H, Ghosh S, Wang H (2019) Robust profit maximization with double sandwich algorithms in social networks. In: 2019 IEEE 39th international conference on distributed computing systems (ICDCS). IEEE, pp 1539–1548
Goyal A, Lu W, Lakshmanan LV (2011) Simpath: an efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th international conference on data mining. IEEE, pp 211–220
Han K, Wu B, Tang J, Cui S, Aslay C, Lakshmanan LV (2021) Efficient and effective algorithms for revenue maximization in social advertising. In: Proceedings of the 2021 international conference on management of data, pp 671–684
Han S, Zhuang F, He Q, Shi Z (2014) Balanced seed selection for budgeted influence maximization in social networks. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 65–77
Huang K, Tang J, Xiao X, Sun A, Lim A (2020) Efficient approximation algorithms for adaptive target profit maximization. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 649–660
Jung K, Heo W, Chen W (2012) Irie: scalable and robust influence maximization in social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 918–923
Ke X, Khan A, Cong G (2018) Finding seeds and relevant tags jointly: for targeted influence maximization in social networks. In: Proceedings of the 2018 international conference on management of data. ACM, pp 1097–1111
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 137–146
Li W, Liu W, Chen T, Qu X, Fang Q, Ko KI (2017) Competitive profit maximization in social networks. Theor Comput Sci 694:1–9
Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275:1601–1613
Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852–1872
Liu B, Li X, Wang H, Fang Q, Dong J, Wu W (2020) Profit maximization problem with coupons in social networks. Theor Comput Sci 803:22–35
Lu F, Zhang W, Shao L, Jiang X, Xu P, Jin H (2017) Scalable influence maximization under independent cascade model. J Netw Comput Appl 86:15–23
Lu W, Lakshmanan LV (2012) Profit maximization over social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 479–488
Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084–1094
Shang J, Zhou S, Li X, Liu L, Wu H (2017) Cofim: a community-based framework for influence maximization on large-scale networks. Knowl-Based Syst 117:88–100
Tang J, Tang X, Yuan J (2017) Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans Knowl Data Eng 30(6):1095–1108
Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):1–19
Tang Y, Xiao X, Shi Y (2014) Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on management of data. ACM, pp 75–86
Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Discov 25(3):545–576
Yang Y, Xu Y, Wang E, Lou K, Luan D (2018) Exploring influence maximization in online and offline double-layer propagation scheme. Inf Sci 450:182–199
Zhao T, McAuley J, King I (2015) Improving latent factor models via personalized feature projection for one class recommendation. In: Proceedings of the 24th ACM international on conference on information and knowledge management. ACM, pp 821–830
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A small part of this work has been previously published as Banerjee et al. (2020c).
Rights and permissions
About this article
Cite this article
Banerjee, S., Pal, B. Budgeted influence and earned benefit maximization with tags in social networks. Soc. Netw. Anal. Min. 12, 21 (2022). https://doi.org/10.1007/s13278-021-00850-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-021-00850-z