{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T00:27:36Z","timestamp":1722644856397},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T00:00:00Z","timestamp":1717632000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T00:00:00Z","timestamp":1717632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Fundamental Research Funds for the Universities of Heilongjiang","award":["145109217","145109217","145109217","145109217","145109217","135509234"],"award-info":[{"award-number":["145109217","145109217","145109217","145109217","145109217","135509234"]}]},{"name":"Youth Science and Technology Innovation Personnel Training Project of Heilongjiang","award":["UNPYSCT-2020072"],"award-info":[{"award-number":["UNPYSCT-2020072"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11227-024-06252-0","type":"journal-article","created":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T06:01:44Z","timestamp":1717653704000},"page":"21149-21178","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Time and value aware influence blocking maximization in geo-social networks"],"prefix":"10.1007","volume":"80","author":[{"given":"Wenlong","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chongyuan","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yufan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingchun","family":"Diao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangshuang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,6]]},"reference":[{"key":"6252_CR1","doi-asserted-by":"crossref","unstructured":"He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 2012 SIAM International Conference on Data Mining, SIAM, pp 463\u2013474","DOI":"10.1137\/1.9781611972825.40"},{"key":"6252_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.comnet.2017.05.004","volume":"123","author":"P Wu","year":"2017","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350","journal-title":"Comput Netw"},{"key":"6252_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2021.02.063","volume":"564","author":"L Chen","year":"2021","unstructured":"Chen L, Zhang Y, Chen Y, Li B, Liu W (2021) Negative influence blocking maximization with uncertain sources under the independent cascade model. Inf Sci 564:343\u2013367","journal-title":"Inf Sci"},{"key":"6252_CR4","doi-asserted-by":"publisher","first-page":"133677","DOI":"10.1016\/j.physd.2023.133677","volume":"446","author":"R Zhang","year":"2023","unstructured":"Zhang R, Wang X, Pei S (2023) Targeted influence maximization in complex networks. Physica D 446:133677","journal-title":"Physica D"},{"key":"6252_CR5","doi-asserted-by":"publisher","first-page":"118052","DOI":"10.1016\/j.eswa.2022.118052","volume":"207","author":"MA Manouchehri","year":"2022","unstructured":"Manouchehri MA, Helfroush MS, Danyali H (2022) Non-uniform influence blocking maximization in social network. Expert Syst Appl 207:118052","journal-title":"Expert Syst Appl"},{"key":"6252_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2021.03.036","volume":"868","author":"Q Shi","year":"2021","unstructured":"Shi Q, Wang C, Ye D, Chen J, Zhou S, Feng Y, Chen C, Huang Y (2021) Profit maximization for competitive social advertising. Theoret Comput Sci 868:12\u201329","journal-title":"Theoret Comput Sci"},{"issue":"6","key":"6252_CR7","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1177\/0165551515602808","volume":"41","author":"A Mohammadi","year":"2015","unstructured":"Mohammadi A, Saraee M, Mirzaei A (2015) Time-sensitive influence maximization in social networks. J Inf Sci 41(6):765\u2013778","journal-title":"J Inf Sci"},{"key":"6252_CR8","doi-asserted-by":"publisher","first-page":"42052","DOI":"10.1109\/ACCESS.2019.2894155","volume":"7","author":"Q Liqing","year":"2019","unstructured":"Liqing Q, Jinfeng Y, Xin F, Wei J, Wenwen G (2019) Analysis of influence maximization in temporal social networks. IEEE Access 7:42052\u201342062","journal-title":"IEEE Access"},{"key":"6252_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 591\u2013598","DOI":"10.1609\/aaai.v26i1.8204"},{"issue":"3","key":"6252_CR10","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s00607-021-00987-x","volume":"104","author":"S Banerjee","year":"2022","unstructured":"Banerjee S, Jenamani M, Pratihar DK (2022) An approximate marginal spread computation approach for the budgeted influence maximization with delay. Computing 104(3):657\u2013680","journal-title":"Computing"},{"key":"6252_CR11","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete algorithms, SIAM, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"6252_CR12","doi-asserted-by":"crossref","unstructured":"Tang J, Tang X, Xiao X, Yuan J (2018) Online processing algorithms for influence maximization. In: Proceedings of the 2018 International Conference on Management of Data, pp 991\u20131005","DOI":"10.1145\/3183713.3183749"},{"key":"6252_CR13","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge discovery and data mining, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"key":"6252_CR14","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, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"6252_CR15","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007. Proceedings 3, Springer, pp 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"6252_CR16","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El\u00a0Abbadi A (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"issue":"4","key":"6252_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01850-3","volume":"5","author":"W Chen","year":"2013","unstructured":"Chen W, Lakshmanan LV, Castillo C (2013) Information and influence propagation in social networks. Synth Lect Data Manag 5(4):1\u2013177","journal-title":"Synth Lect Data Manag"},{"key":"6252_CR18","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"6252_CR19","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011) 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\u201348","DOI":"10.1145\/1963192.1963217"},{"key":"6252_CR20","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"6252_CR21","doi-asserted-by":"publisher","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","volume":"142","author":"A Zareie","year":"2020","unstructured":"Zareie A, Sheikhahmadi A, Jalili M (2020) Identification of influential users in social network using gray wolf optimization algorithm. Expert Syst Appl 142:112971","journal-title":"Expert Syst Appl"},{"issue":"3","key":"6252_CR22","first-page":"3111","volume":"74","author":"W Zhu","year":"2023","unstructured":"Zhu W, Miao Y, Yang S, Lian Z, Cui L (2023) An influence maximization algorithm based on improved k-shell in temporal social networks. Comput Mater Contin 74(3):3111\u20133131","journal-title":"Comput Mater Contin"},{"key":"6252_CR23","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, pp 75\u201386","DOI":"10.1145\/2588555.2593670"},{"key":"6252_CR24","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence maximization in near-linear time: a martingale approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"6252_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen HT, Thai MT, Dinh TN (2016) Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks. In: Proceedings of the 2016 International Conference on Management of Data, pp 695\u2013710","DOI":"10.1145\/2882903.2915207"},{"issue":"3","key":"6252_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3533817","volume":"47","author":"Q Guo","year":"2022","unstructured":"Guo Q, Wang S, Wei Z, Lin W, Tang J (2022) Influence maximization revisited: efficient sampling with bound tightened. ACM Trans Database Syst 47(3):1\u201345","journal-title":"ACM Trans Database Syst"},{"key":"6252_CR27","doi-asserted-by":"publisher","first-page":"100206","DOI":"10.1016\/j.osnem.2022.100206","volume":"29","author":"A Zareie","year":"2022","unstructured":"Zareie A, Sakellariou R (2022) Rumour spread minimization in social networks: a source-ignorant approach. Online Soc Netw Media 29:100206","journal-title":"Online Soc Netw Media"},{"issue":"1","key":"6252_CR28","first-page":"386","volume":"29","author":"J Guo","year":"2020","unstructured":"Guo J, Chen T, Wu W (2020) A multi-feature diffusion model: rumor blocking in social networks. IEEE\/ACM Trans Netw 29(1):386\u2013397","journal-title":"IEEE\/ACM Trans Netw"},{"key":"6252_CR29","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2022.11.041","volume":"619","author":"Z Liang","year":"2023","unstructured":"Liang Z, He Q, Du H, Xu W (2023) Targeted influence maximization in competitive social networks. Inf Sci 619:390\u2013405","journal-title":"Inf Sci"},{"key":"6252_CR30","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2020.08.030","volume":"840","author":"Q Ni","year":"2020","unstructured":"Ni Q, Guo J, Huang C, Wu W (2020) Community-based rumor blocking maximization in social networks: algorithms and analysis. Theoret Comput Sci 840:257\u2013269","journal-title":"Theoret Comput Sci"},{"key":"6252_CR31","doi-asserted-by":"crossref","unstructured":"Arazkhani N, Meybodi MR, Rezvanian A (2019) Influence blocking maximization in social network using centrality measures. In: 2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI), IEEE, pp 492\u2013497","DOI":"10.1109\/KBEI.2019.8734920"},{"issue":"3","key":"6252_CR32","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.3934\/mbe.2021133","volume":"18","author":"H Wu","year":"2021","unstructured":"Wu H, Zhang Z, Fang Y, Zhang S, Jiang Z, Huang J, Li P (2021) Containment of rumor spread by selecting immune nodes in social networks. Math Biosci Eng 18(3):2614\u20132631","journal-title":"Math Biosci Eng"},{"key":"6252_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-014-0214-4","volume":"4","author":"L Fan","year":"2014","unstructured":"Fan L, Wu W, Zhai X, Xing K, Lee W, Du DZ (2014) Maximizing rumor containment in social networks with constrained time. Soc Netw Anal Min 4:1\u201310","journal-title":"Soc Netw Anal Min"},{"key":"6252_CR34","doi-asserted-by":"crossref","unstructured":"Song C, Hsu W, Lee ML (2017) Temporal influence blocking: minimizing the effect of misinformation in social networks. In: 2017 IEEE 33rd international Conference on Data Engineering (ICDE), IEEE, pp 847\u2013858","DOI":"10.1109\/ICDE.2017.134"},{"issue":"7","key":"6252_CR35","doi-asserted-by":"publisher","first-page":"4578","DOI":"10.1109\/TSMC.2021.3098630","volume":"52","author":"MA Manouchehri","year":"2021","unstructured":"Manouchehri MA, Helfroush MS, Danyali H (2021) Temporal rumor blocking in online social networks: a sampling-based approach. IEEE Trans Syst Man Cybern Syst 52(7):4578\u20134588","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"6252_CR36","doi-asserted-by":"publisher","first-page":"61462","DOI":"10.1109\/ACCESS.2018.2876141","volume":"6","author":"W Zhu","year":"2018","unstructured":"Zhu W, Yang W, Xuan S, Man D, Wang W, Du X (2018) Location-aware influence blocking maximization in social networks. IEEE Access 6:61462\u201361477","journal-title":"IEEE Access"},{"issue":"1","key":"6252_CR37","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1080\/15427951.2006.10129115","volume":"3","author":"F Chung","year":"2006","unstructured":"Chung F, Lu L (2006) Concentration inequalities and martingale inequalities: a survey. Internet Math 3(1):79\u2013127","journal-title":"Internet Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06252-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-06252-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-06252-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T14:03:45Z","timestamp":1722607425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-06252-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,6]]},"references-count":37,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["6252"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-06252-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,6,6]]},"assertion":[{"value":"18 May 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}