{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:50:52Z","timestamp":1776682252338,"version":"3.51.2"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T00:00:00Z","timestamp":1739232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"crossref","award":["202204910325"],"award-info":[{"award-number":["202204910325"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72074203"],"award-info":[{"award-number":["72074203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2025,2,28]]},"abstract":"<jats:p>When information dissemination campaigns on Online Social Networking platforms are too aggressive, this can easily cause information overexposure. Overexposure can break through the psychological and physiological limits that the audience can tolerate, making it difficult for the audience to obtain reasonable cognitive concepts. For example, the overexposure of information referring to an object in a promotional campaign can lead to inflated expectations in individuals. Building on this, we introduce two indicators for individuals\u2019 expectations and actual utility of the object and design a multi-stage triggered mechanism for seed individuals to explore the relieving overexposure problem in information diffusion. We build a multi-stage information diffusion model and characterize the evolution of individual expectations. We verify the hardness result of the relieving overexposure problem by budget multi-stage allocation, and the non-submodularity and non-monotonicity of the objective function. Addressing the non-monotonic and non-submodular set function, we provide a direct influence-oriented algorithm with a greedy approach. Extensive experiments are performed on four real networks to explore how model parameters and network properties affect the effects of multi-stage triggered strategies for seed individuals. Using the experiments, we found that the seed individual multi-stage incremental triggered strategy of dissemination campaign of information referring to an object shows better performance, and the lower the actual utility of the specific object, the more accurate the promotion strategy needs to be developed.<\/jats:p>","DOI":"10.1145\/3708537","type":"journal-article","created":{"date-parts":[[2024,12,17]],"date-time":"2024-12-17T11:24:01Z","timestamp":1734434641000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Relieving Overexposure in Information Diffusion Through a Budget Multi-stage Allocation"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0054-2323","authenticated-orcid":false,"given":"Peikun","family":"Ni","sequence":"first","affiliation":[{"name":"University of the Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0151-6469","authenticated-orcid":false,"given":"Barbara","family":"Guidi","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8005-8701","authenticated-orcid":false,"given":"Andrea","family":"Michienzi","sequence":"additional","affiliation":[{"name":"Computer Science, University of Pisa, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"additional","affiliation":[{"name":"University of the Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_3_3_2_2","volume-title":"Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence (AAAI\u201918\/IAAI\u201918\/EAAI\u201918)","author":"Abebe Rediet","year":"2018","unstructured":"Rediet Abebe, Lada A. Adamic, and Jon Kleinberg. 2018. Mitigating overexposure in viral marketing. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence (AAAI\u201918\/IAAI\u201918\/EAAI\u201918). AAAI Press, New Orleans, Louisiana, Article 30, 8 pages."},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102321"},{"key":"e_1_3_3_4_2","volume-title":"Contagious: Why Things Catch on","author":"Berger Jonah","year":"2016","unstructured":"Jonah Berger. 2016. Contagious: Why Things Catch on. Simon and Schuster."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1509\/jmr.10.0353"},{"key":"e_1_3_3_6_2","series-title":"EC\u201912","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/2229012.2229034","volume-title":"Proceedings of the 13th ACM Conference on Electronic Commerce","author":"Byers John W.","year":"2012","unstructured":"John W. Byers, Michael Mitzenmacher, and Georgios Zervas. 2012. The groupon effect on yelp ratings: A root cause analysis. In Proceedings of the 13th ACM Conference on Electronic Commerce (Valencia, Spain) (EC\u201912). Association for Computing Machinery, New York, NY, 248\u2013265."},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797315306"},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.03.016"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.07.012"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/3295222.3295334"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1387-8"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.5555\/3535850.3535923"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102264"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1177\/0001839214523602"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102818"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119529"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.041"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.102956"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/3408315"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3059430"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118052"},{"key":"e_1_3_3_23_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007718715162"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.03.041"},{"key":"e_1_3_3_25_2","series-title":"ASONAM\u201919","first-page":"65","volume-title":"Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining","author":"Rozemberczki Benedek","year":"2020","unstructured":"Benedek Rozemberczki, Ryan Davies, Rik Sarkar, and Charles Sutton. 2020. GEMSEC: Graph embedding with self clustering. In Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (Vancouver, British Columbia, Canada) (ASONAM\u201919). Association for Computing Machinery, New York, NY, 65\u201372."},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114293"},{"issue":"2","key":"e_1_3_3_27_2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.26599\/BDMA.2021.9020024","article-title":"A novel influence maximization algorithm for a competitive environment based on social media data analytics","volume":"5","author":"Tong Jie","year":"2022","unstructured":"Jie Tong, Leilei Shi, Lu Liu, John Panneerselvam, and Zixuan Han. 2022. A novel influence maximization algorithm for a competitive environment based on social media data analytics. Big Data Mining and Analytics 5, 2 (2022), 130\u2013139.","journal-title":"Big Data Mining and Analytics"},{"issue":"3","key":"e_1_3_3_28_2","doi-asserted-by":"crossref","first-page":"103319","DOI":"10.1016\/j.ipm.2023.103319","article-title":"Information analysis for dynamic sale planning by AI decision support process","volume":"60","author":"Wang Feng","year":"2023","unstructured":"Feng Wang, Yu Luan, Abdel Nour Badawi, Abbad Ayad, Abdel Fattah Abdallah, Mansour Ali, Zobair Ahmad, and Wu Jiang. 2023. Information analysis for dynamic sale planning by AI decision support process. Information Processing and Management 60, 3 (2023), 103319.","journal-title":"Information Processing and Management"},{"issue":"3","key":"e_1_3_3_29_2","first-page":"43","article-title":"Parallel greedy algorithm to multiple influence maximization in social network","volume":"15","author":"Wu Guanhao","year":"2021","unstructured":"Guanhao Wu, Xiaofeng Gao, Ge Yan, and Guihai Chen. 2021. Parallel greedy algorithm to multiple influence maximization in social network. ACM Transactions on Knowledge Discovery form Data 15, 3, Article 43 (apr2021), 21 pages.","journal-title":"ACM Transactions on Knowledge Discovery form Data"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103161"},{"issue":"3","key":"e_1_3_3_31_2","first-page":"1067","article-title":"Minimizing influence of rumors by blockers on social networks: Algorithms and analysis","volume":"7","author":"Yan Ruidong","year":"2019","unstructured":"Ruidong Yan, Deying Li, Weili Wu, Ding-Zhu Du, and Yongcai Wang. 2019. Minimizing influence of rumors by blockers on social networks: Algorithms and analysis. IEEE Transactions on Network Science and Engineering 7, 3 (2019), 1067\u20131078.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"5","key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"103438","DOI":"10.1016\/j.ipm.2023.103438","article-title":"Identifying underlying influential factors in information diffusion process on social media platform: A hybrid approach of data mining and time series regression","volume":"60","author":"Yan Zhen","year":"2023","unstructured":"Zhen Yan, Xiao Zhou, Jie Ren, Qiuyun Zhang, and Rong Du. 2023. Identifying underlying influential factors in information diffusion process on social media platform: A hybrid approach of data mining and time series regression. Information Processing and Management 60, 5 (2023), 103438.","journal-title":"Information Processing and Management"},{"key":"e_1_3_3_33_2","first-page":"635","volume-title":"Proceedings of the International AAAI Conference on Web and Social Media","author":"Zafarani Reza","year":"2014","unstructured":"Reza Zafarani and Huan Liu. 2014. Users joining multiple sites: Distributions and patterns. In Proceedings of the International AAAI Conference on Web and Social Media. AAAI Press, Ann Arbor, 635\u2013638."},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.014"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102679"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2021.3073064"},{"issue":"2","key":"e_1_3_3_37_2","first-page":"1088","article-title":"2-hop+ sampling: Efficient and effective influence estimation","volume":"35","author":"Zhu Yuqing","year":"2023","unstructured":"Yuqing Zhu, Jing Tang, Xueyan Tang, Sibo Wang, and Andrew Lim. 2023. 2-hop+ sampling: Efficient and effective influence estimation. IEEE Transactions on Knowledge and Data Engineering 35, 2 (2023), 1088\u20131103.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_38_2","first-page":"1941","volume-title":"2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS\u201919)","author":"Zhu Yuqing","year":"2019","unstructured":"Yuqing Zhu, Ping Yin, Deying Li, and Bill Lin. 2019. Strengthening the positive effect of viral marketing. In 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS\u201919). IEEE, Dallas, TX, 1941\u20131950."}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708537","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3708537","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:46Z","timestamp":1750295866000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3708537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,11]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,28]]}},"alternative-id":["10.1145\/3708537"],"URL":"https:\/\/doi.org\/10.1145\/3708537","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,11]]},"assertion":[{"value":"2023-11-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-12-09","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}