{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:41:53Z","timestamp":1743115313589,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_24","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"317-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing Diversity and\u00a0Persuasiveness of\u00a0Opinion Articles in\u00a0Social Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4553-3762","authenticated-orcid":false,"given":"Liman","family":"Du","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","unstructured":"Chen, W., Wang, C., Wang, Y.: 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, pp. 1029\u20131038. KDD 2010, Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"24_CR2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2023301118","volume":"118","author":"M Cinelli","year":"2021","unstructured":"Cinelli, M., Morales, G., Galeazzi, A., Quattrociocchi, W., Starnini, M.: The echo chamber effect on social media. Proc. Natl. Acad. Sci. 118, e2023301118 (2021). https:\/\/doi.org\/10.1073\/pnas.2023301118","journal-title":"Proc. Natl. Acad. Sci."},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Ferraz de Arruda, H., et al.: Modelling how social network algorithms can influence opinion polarization. Inf. Sci. 588, 265\u2013278 (2022). https:\/\/doi.org\/10.1016\/j.ins.2021.12.069","DOI":"10.1016\/j.ins.2021.12.069"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Galam, S.: Real space renormalization group and totalitarian paradox of majority rule voting. Phys. A Statist. Mech. Appl. 285(1), 66\u201376 (2000). https:\/\/doi.org\/10.1016\/S0378-4371(00)00272-7","DOI":"10.1016\/S0378-4371(00)00272-7"},{"key":"24_CR5","doi-asserted-by":"publisher","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.V.: 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. WWW 2011, Association for Computing Machinery, New York, NY, USA (2011). https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"issue":"3","key":"24_CR6","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.: Influence maximization revisited: efficient sampling with bound tightened. ACM Trans. Database Syst. 47(3), 1\u201345 (2022). https:\/\/doi.org\/10.1145\/3533817","journal-title":"ACM Trans. Database Syst."},{"issue":"6","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjp\/s13360-020-00541-2","volume":"135","author":"H Noorazar","year":"2020","unstructured":"Noorazar, H.: Recent advances in opinion propagation dynamics: a 2020 survey. Eur. Phys. J. Plus 135(6), 1\u201320 (2020). https:\/\/doi.org\/10.1140\/epjp\/s13360-020-00541-2","journal-title":"Eur. Phys. J. Plus"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep03008","volume":"3","author":"R Kaur","year":"2013","unstructured":"Kaur, R., Kumar, R., Bhondekar, A., Kapur, P.: Human opinion dynamics: an inspiration to solve complex optimization problems. Sci. Rep. 3, 1\u20137 (2013). https:\/\/doi.org\/10.1038\/srep03008","journal-title":"Sci. Rep."},{"key":"24_CR9","doi-asserted-by":"publisher","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, pp. 137\u2013146. KDD 2003, Association for Computing Machinery, New York, NY, USA (2003). https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"24_CR10","doi-asserted-by":"publisher","unstructured":"Kunegis, J.: KONECT - The Koblenz network collection. In: Proceedings of International Conference on World Wide Web Companion, pp. 1343\u20131350 (2013). https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-021-01123-x","volume":"6","author":"C Lu","year":"2022","unstructured":"Lu, C., Yang, W., Yang, R., Gao, S.: Maximizing a non-decreasing non-submodular function subject to various types of constraints. J. Global Optim. 6, 1\u201325 (2022). https:\/\/doi.org\/10.1007\/s10898-021-01123-x","journal-title":"J. Global Optim."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14778\/2850578.2850581","volume":"9","author":"W Lu","year":"2015","unstructured":"Lu, W., Chen, W., Lakshmanan, L.V.S.: From competition to complementarity: comparative influence diffusion and maximization. Proc. VLDB Endow. 9(2), 60\u201371 (2015). https:\/\/doi.org\/10.14778\/2850578.2850581","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"24_CR13","doi-asserted-by":"publisher","first-page":"4357","DOI":"10.1109\/TKDE.2020.3038711","volume":"34","author":"A Matakos","year":"2022","unstructured":"Matakos, A., Aslay, C., Galbrun, E., Gionis, A.: Maximizing the diversity of exposure in a social network. IEEE Trans. Knowl. Data Eng. 34(9), 4357\u20134370 (2022). https:\/\/doi.org\/10.1109\/TKDE.2020.3038711","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1111\/1467-9760.00148","volume":"10","author":"C Sunstein","year":"2002","unstructured":"Sunstein, C.: The law of group polarization. J. Polit. Philos. 10, 175\u2013195 (2002). https:\/\/doi.org\/10.1111\/1467-9760.00148","journal-title":"J. Polit. Philos."},{"issue":"4","key":"24_CR15","doi-asserted-by":"publisher","first-page":"48002","DOI":"10.1209\/0295-5075\/96\/48002","volume":"96","author":"K Sznajd-Weron","year":"2011","unstructured":"Sznajd-Weron, K., Tabiszewski, M., Timpanaro, A.M.: Phase transition in the sznajd model with independence. EPL (Europhys. Lett.) 96(4), 48002 (2011). https:\/\/doi.org\/10.1209\/0295-5075\/96\/48002","journal-title":"EPL (Europhys. Lett.)"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Tang, Y., Shi, Y., Xiao, X.: 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. SIGMOD 2015, Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"key":"24_CR17","unstructured":"Wenruo, B., Jeffrey, A.B.: Greed is still good: maximizing monotone submodular+supermodular functions. CoRR abs\/1801.07413 (2018). http:\/\/arxiv.org\/abs\/1801.07413"},{"issue":"5","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/TCSS.2021.3073064","volume":"8","author":"J Zhu","year":"2021","unstructured":"Zhu, J., Ni, P., Tong, G., Wang, G., Huang, J.: Influence maximization problem with echo chamber effect in social network. IEEE Trans. Comput. Soc. Syst. 8(5), 1163\u20131171 (2021). https:\/\/doi.org\/10.1109\/TCSS.2021.3073064","journal-title":"IEEE Trans. Comput. Soc. Syst."}],"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-3-031-49193-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:06:34Z","timestamp":1702026394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","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":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}