{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:50:26Z","timestamp":1777614626269,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T00:00:00Z","timestamp":1640131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-021-00850-z","type":"journal-article","created":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T10:02:34Z","timestamp":1640167354000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Budgeted influence and earned benefit maximization with tags in social networks"],"prefix":"10.1007","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1761-5944","authenticated-orcid":false,"given":"Suman","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bithika","family":"Pal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,22]]},"reference":[{"key":"850_CR1","doi-asserted-by":"crossref","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2019a) Combim: a community-based solution approach for the budgeted influence maximization problem. Expert Syst Appl","DOI":"10.1016\/j.eswa.2019.01.070"},{"key":"850_CR2","doi-asserted-by":"crossref","unstructured":"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\u201317","DOI":"10.1145\/3297001.3297051"},{"issue":"6","key":"850_CR3","doi-asserted-by":"publisher","first-page":"2539","DOI":"10.1007\/s12652-019-01308-z","volume":"11","author":"S Banerjee","year":"2020","unstructured":"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\u20132555","journal-title":"J Ambient Intell Hum Comput"},{"key":"850_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2020b) A survey on influence maximization in a social network. Knowl Inf Syst: 1\u201339","DOI":"10.1007\/s10115-020-01461-4"},{"key":"850_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013152","DOI":"10.1007\/978-3-030-62005-9_11"},{"key":"850_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013392","DOI":"10.1007\/978-3-319-31204-0_25"},{"key":"850_CR7","doi-asserted-by":"crossref","unstructured":"Cai C, He R, McAuley J (2017) Spmc: socially-aware personalized markov chains for sparse sequential recommendation. Preprint arXiv:1708.04497","DOI":"10.24963\/ijcai.2017\/204"},{"key":"850_CR8","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/2043932.2044016"},{"key":"850_CR9","unstructured":"Chen T, Guo J, Wu W (2020) Adaptive multi-feature budgeted profit maximization in social networks. Preprint arXiv:2006.03222"},{"key":"850_CR10","doi-asserted-by":"crossref","unstructured":"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\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"850_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013390","DOI":"10.1137\/1.9781611972818.33"},{"issue":"2","key":"850_CR12","first-page":"25","volume":"5","author":"YC Chen","year":"2014","unstructured":"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","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"850_CR13","doi-asserted-by":"crossref","unstructured":"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\u20131548","DOI":"10.1109\/ICDCS.2019.00153"},{"key":"850_CR14","doi-asserted-by":"crossref","unstructured":"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\u2013220","DOI":"10.1109\/ICDM.2011.132"},{"key":"850_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013684","DOI":"10.1145\/3448016.3459243"},{"key":"850_CR16","doi-asserted-by":"crossref","unstructured":"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\u201377","DOI":"10.1007\/978-3-319-06608-0_6"},{"key":"850_CR17","doi-asserted-by":"crossref","unstructured":"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\u2013660","DOI":"10.1109\/ICDE48307.2020.00062"},{"key":"850_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"850_CR19","doi-asserted-by":"crossref","unstructured":"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\u20131111","DOI":"10.1145\/3183713.3199670"},{"key":"850_CR20","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (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\u2013146","DOI":"10.1145\/956750.956769"},{"key":"850_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.06.026","volume":"694","author":"W Li","year":"2017","unstructured":"Li W, Liu W, Chen T, Qu X, Fang Q, Ko KI (2017) Competitive profit maximization in social networks. Theor Comput Sci 694:1\u20139","journal-title":"Theor Comput Sci"},{"key":"850_CR22","doi-asserted-by":"publisher","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","volume":"275","author":"X Li","year":"2018","unstructured":"Li X, Cheng X, Su S, Sun C (2018) Community-based seeds selection algorithm for location aware influence maximization. Neurocomputing 275:1601\u20131613","journal-title":"Neurocomputing"},{"issue":"10","key":"850_CR23","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: a survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"850_CR24","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2019.03.007","volume":"803","author":"B Liu","year":"2020","unstructured":"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\u201335","journal-title":"Theor Comput Sci"},{"key":"850_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.jnca.2016.10.020","volume":"86","author":"F Lu","year":"2017","unstructured":"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\u201323","journal-title":"J Netw Comput Appl"},{"key":"850_CR26","doi-asserted-by":"crossref","unstructured":"Lu W, Lakshmanan LV (2012) Profit maximization over social networks. In: 2012 IEEE 12th international conference on data mining. IEEE, pp 479\u2013488","DOI":"10.1109\/ICDM.2012.145"},{"issue":"6","key":"850_CR27","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen H, Zheng R (2013) On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6):1084\u20131094","journal-title":"IEEE J Sel Areas Commun"},{"key":"850_CR28","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.knosys.2016.09.029","volume":"117","author":"J Shang","year":"2017","unstructured":"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\u2013100","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"850_CR29","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1109\/TKDE.2017.2787757","volume":"30","author":"J Tang","year":"2017","unstructured":"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\u20131108","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"850_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"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\u201319","journal-title":"Soc Netw Anal Min"},{"key":"850_CR31","doi-asserted-by":"crossref","unstructured":"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\u201386","DOI":"10.1145\/2588555.2593670"},{"issue":"3","key":"850_CR32","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"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\u2013576","journal-title":"Data Min Knowl Discov"},{"key":"850_CR33","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.ins.2018.03.048","volume":"450","author":"Y Yang","year":"2018","unstructured":"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\u2013199","journal-title":"Inf Sci"},{"key":"850_CR34","doi-asserted-by":"crossref","unstructured":"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\u2013830","DOI":"10.1145\/2806416.2806511"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00850-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00850-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00850-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T13:38:25Z","timestamp":1672666705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00850-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,22]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["850"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00850-z","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,22]]},"assertion":[{"value":"26 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"21"}}