{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:38:09Z","timestamp":1743147489868,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_10","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:17Z","timestamp":1739999897000},"page":"116-127","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Target Influence Maximization Against Overexposure Under Threshold-Dependent Model in\u00a0Online Social Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3136-7864","authenticated-orcid":false,"given":"Xiaoping","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Guoqing","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0054-2323","authenticated-orcid":false,"given":"Peikun","family":"Ni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abebe, R., Adamic, L.A., Kleinberg, J.: 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 (2018)","DOI":"10.1609\/aaai.v32i1.11282"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Goyal, A., Lakshmanan, L.V.: Maximizing product adoption in social networks. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, Seattle Washington USA, pp. 603\u2013612. ACM (2012)","DOI":"10.1145\/2124295.2124368"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.knosys.2017.07.029","volume":"134","author":"A Bozorgi","year":"2017","unstructured":"Bozorgi, A., Samet, S., Kwisthout, J., Wareham, T.: Community-based influence maximization in social networks under a competitive linear threshold model. Knowl.-Based Syst. 134, 149\u2013158 (2017)","journal-title":"Knowl.-Based Syst."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.tcs.2020.12.041","volume":"857","author":"S Chen","year":"2021","unstructured":"Chen, S., Yang, W., Gao, S., Jin, R.: Novel algorithms for maximum DS decomposition. Theoret. Comput. Sci. 857, 87\u201396 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"2528","DOI":"10.1109\/TNSE.2020.2997021","volume":"7","author":"S Gao","year":"2020","unstructured":"Gao, S., Zhang, Z., Su, S., Wen, J., Sun, L.: Fair-aware competitive event influence maximization in social networks. IEEE Trans. Network Sci. Eng. 7(4), 2528\u20132540 (2020)","journal-title":"IEEE Trans. Network Sci. Eng."},{"key":"10_CR6","unstructured":"Irfan, M.T., Hancock, K., Friel, L.M.: Cascades and overexposure in social networks: the budgeted case. In: Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems (2022)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Iyer, S., Adamic, L.A.: When can overambitious seeding cost you? Appl. Network Sci. 4(1), 38 (2019)","DOI":"10.1007\/s41109-019-0146-z"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Jeong, J., Moon, S.: Invite your friends and get rewards: dynamics of incentivized friend invitation in Kakaotalk mobile games. In: Proceedings of the Second ACM Conference on Online Social Networks, Dublin Ireland, pp. 151\u2013160. ACM (2014)","DOI":"10.1145\/2660460.2660468"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, D.C., pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Liu, B., Cong, G., Xu, D., Zeng, Y.: Time constrained influence maximization in social networks. In: 2012 IEEE 12th International Conference on Data Mining, Brussels, Belgium, pp. 439\u2013448. IEEE (2012)","DOI":"10.1109\/ICDM.2012.158"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Loukides, G., Gwadera, R., Chang, S.W.: Overexposure-aware influence maximization. ACM Trans. Internet Technol. 20(4), 1\u201331 (2020). number: 4","DOI":"10.1145\/3408315"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Lu, W., Bonchi, F., Goyal, A., Lakshmanan, L.V.: The bang for the buck: fair competitive viral marketing from the host perspective. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago Illinois USA, pp. 928\u2013936. ACM (2013)","DOI":"10.1145\/2487575.2487649"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Mossel, E., Roch, S.: On the submodularity of influence in social networks. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego California USA, pp. 128\u2013134. ACM (2007)","DOI":"10.1145\/1250790.1250811"},{"key":"10_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119646","volume":"648","author":"P Ni","year":"2023","unstructured":"Ni, P., Guidi, B., Michienzi, A., Zhu, J.: Equilibrium of individual concern-critical influence maximization in virtual and real blending network. Inf. Sci. 648, 119646 (2023)","journal-title":"Inf. Sci."},{"key":"10_CR15","unstructured":"Ni, P., Zhu, J., Wang, G.: Activity-oriented production promotion utility maximization in metaverse social networks. IEEE\/ACM Transactions on Networking, pp. 1\u201315 (2023)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Tump, A.N., Pleskac, T.J., Kurvers, R.H.J.M.: Wise or mad crowds? The cognitive mechanisms underlying information cascades. Sci. Adv. 6(29), eabb0266 (2020)","DOI":"10.1126\/sciadv.abb0266"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"1613","DOI":"10.1109\/TEM.2023.3336370","volume":"71","author":"Z Wang","year":"2024","unstructured":"Wang, Z., Song, J., Zhao, J.: Enhancing product promotion in social networks: leveraging adaptive discount-offering and the crowd effect. IEEE Trans. Eng. Manage. 71, 1613\u20131628 (2024)","journal-title":"IEEE Trans. Eng. Manage."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:28Z","timestamp":1739999908000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}