{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:42Z","timestamp":1740122442223,"version":"3.37.3"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071459","11991022"],"award-info":[{"award-number":["12071459","11991022"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10878-024-01226-7","type":"journal-article","created":{"date-parts":[[2024,11,2]],"date-time":"2024-11-02T00:06:35Z","timestamp":1730505995000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing diversity and persuasiveness of opinion articles in social networks"],"prefix":"10.1007","volume":"48","author":[{"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":[[2024,11,1]]},"reference":[{"issue":"3","key":"1226_CR1","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1037\/0033-295X.97.3.362","volume":"97","author":"N Andrzej","year":"1990","unstructured":"Andrzej N, Jacek S, Bibb L (1990) From private attitude to public opinion: a dynamic theory of social impact. Psychol Rev 97(3):362. https:\/\/doi.org\/10.1037\/0033-295X.97.3.362","journal-title":"Psychol Rev"},{"key":"1226_CR2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2112552118","volume":"118","author":"S Balietti","year":"2021","unstructured":"Balietti S, Getoor L, Goldstein D, Watts D (2021) Reducing opinion polarization: effects of exposure to similar people with differing political views. Proc Nat Acad Sci 118:e2112552118. https:\/\/doi.org\/10.1073\/pnas.2112552118","journal-title":"Proc Nat Acad Sci"},{"key":"1226_CR3","doi-asserted-by":"publisher","unstructured":"Baravi T, Feinerman O, Raz O (2022) Echo chambers in the Ising model and implications on the mean magnetization. J Stat Mech: Theory Exp 2022:043402. https:\/\/doi.org\/10.1088\/1742-5468\/ac5d42","DOI":"10.1088\/1742-5468\/ac5d42"},{"key":"1226_CR4","doi-asserted-by":"publisher","unstructured":"Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, https:\/\/doi.org\/10.1145\/1835804.1835934","DOI":"10.1145\/1835804.1835934"},{"key":"1226_CR5","doi-asserted-by":"publisher","unstructured":"Cinelli M, Morales G, Galeazzi A, Quattrociocchi W, Starnini M (2021) The echo chamber effect on social media. Proc Nat Acad Sci 118:e2023301118. https:\/\/doi.org\/10.1073\/pnas.2023301118","DOI":"10.1073\/pnas.2023301118"},{"issue":"1","key":"1226_CR6","doi-asserted-by":"publisher","first-page":"9234","DOI":"10.1038\/s41598-022-12494-w","volume":"12","author":"CB Currin","year":"2022","unstructured":"Currin CB, Vera SV, Khaledi-Nasab A (2022) Depolarization of echo chambers by random dynamical nudge. Sci Rep 12(1):9234","journal-title":"Sci Rep"},{"key":"1226_CR7","doi-asserted-by":"publisher","unstructured":"de Arruda HF, Cardoso FM, de Arruda GF, Hern\u00e1ndez AR, da Fontoura Costa L, Moreno Y (2022) Modelling how social network algorithms can influence opinion polarization. Inf Sci 588:265\u2013278. https:\/\/doi.org\/10.1016\/j.ins.2021.12.069","DOI":"10.1016\/j.ins.2021.12.069"},{"key":"1226_CR8","doi-asserted-by":"publisher","unstructured":"Deffuant G, Neau D, Amblard F, Weisbuch G (2000) Mixing beliefs among interacting agents. Adv Comp Syst. https:\/\/doi.org\/10.1142\/S0219525900000078","DOI":"10.1142\/S0219525900000078"},{"key":"1226_CR9","doi-asserted-by":"publisher","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, Association for Computing Machinery, New York, NY, USA, KDD \u201901, p 57-66, https:\/\/doi.org\/10.1145\/502512.502525","DOI":"10.1145\/502512.502525"},{"key":"1226_CR10","first-page":"253","volume":"31","author":"I Ernst","year":"1925","unstructured":"Ernst I (1925) Beitrag zur theorie des ferromagnetismus 31:253\u2013258","journal-title":"Beitrag zur theorie des ferromagnetismus"},{"key":"1226_CR11","first-page":"1715","volume":"12","author":"M Esteve Del Valle","year":"2018","unstructured":"Esteve Del Valle M, Borge Bravo R (2018) Echo chambers in parliamentary twitter networks: the Catalan case. Int J Commun 12:1715\u20131735","journal-title":"Int J Commun"},{"key":"1226_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1140\/epjb\/e20020045","volume":"25","author":"S Galam","year":"2002","unstructured":"Galam S (2002) Minority opinion spreading in random geometry. Europ Phys J B - Condens Matter Comp Syst 25:403\u2013406","journal-title":"Europ Phys J B - Condens Matter Comp Syst"},{"key":"1226_CR13","doi-asserted-by":"publisher","unstructured":"Galam S (2002) Real space renormalization group and totalitarian paradox of majority rule voting. Phys A: Stat Mech Appl 285:66\u201376. https:\/\/doi.org\/10.1016\/S0378-4371(00)00272-7","DOI":"10.1016\/S0378-4371(00)00272-7"},{"key":"1226_CR14","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011a) Celf++: Optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th International Conference Companion on World Wide Web, Association for Computing Machinery, New York, NY, USA, WWW \u201911, p 47-48, https:\/\/doi.org\/10.1145\/1963192.1963217","DOI":"10.1145\/1963192.1963217"},{"key":"1226_CR15","doi-asserted-by":"publisher","unstructured":"Goyal A, Lu W, Lakshmanan LV (2011b) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining, pp 211\u2013220, https:\/\/doi.org\/10.1109\/ICDM.2011.132","DOI":"10.1109\/ICDM.2011.132"},{"key":"1226_CR16","doi-asserted-by":"publisher","unstructured":"Guo Q, Wang S, Wei Z, Lin W, Tang J (2022) Influence maximization revisited: efficient sampling with bound tightened. ACM Trans Database Syst (TODS) 47(3):1\u201345. https:\/\/doi.org\/10.1145\/3533817","DOI":"10.1145\/3533817"},{"key":"1226_CR17","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Cong G, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI Press, AAAI\u201911, p 127-132","DOI":"10.1609\/aaai.v25i1.7838"},{"issue":"6","key":"1226_CR18","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1142\/S0129183100000936","volume":"11","author":"SW Katarzyna","year":"2000","unstructured":"Katarzyna SW, J\u00f2zer S (2000) Opinion evolution in closed community. Int J Mod Phys C 11(6):1157\u20131165","journal-title":"Int J Mod Phys C"},{"key":"1226_CR19","doi-asserted-by":"publisher","unstructured":"Kempe D, Kleinberg J, Tardos E (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, Association for Computing Machinery, New York, NY, USA, KDD \u201903, p 137-146, https:\/\/doi.org\/10.1145\/956750.956769","DOI":"10.1145\/956750.956769"},{"key":"1226_CR20","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. Springer-Verlag, Berlin, Heidelberg, ECMLPKDD\u201906, p 259-271","DOI":"10.1007\/11871637_27"},{"key":"1226_CR21","doi-asserted-by":"publisher","unstructured":"Kunegis J (2013) KONECT \u2013 The Koblenz Network Collection. In: Proc. Int. Conf. on World Wide Web Companion, pp 1343\u20131350, https:\/\/doi.org\/10.1145\/2487788.2488173","DOI":"10.1145\/2487788.2488173"},{"key":"1226_CR22","doi-asserted-by":"publisher","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, Association for Computing Machinery, New York, NY, USA, KDD \u201907, p 420-429, https:\/\/doi.org\/10.1145\/1281192.1281239","DOI":"10.1145\/1281192.1281239"},{"issue":"4","key":"1226_CR23","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10898-021-01123-x","volume":"83","author":"C Lu","year":"2022","unstructured":"Lu C, Yang W, Yang R, Gao S (2022) Maximizing a non-decreasing non-submodular function subject to various types of constraints. J Glob Opt 83(4):727\u2013751","journal-title":"J Glob Opt"},{"key":"1226_CR24","doi-asserted-by":"crossref","unstructured":"Lu W, Chen W, Lakshmanan LVS (2015) From competition to complementarity: Comparative influence diffusion and maximization, Proc VLDB Endow, 9(2), 60\u201371, https:\/\/doi.org\/10.14778\/2850578.2850581","DOI":"10.14778\/2850578.2850581"},{"issue":"2","key":"1226_CR25","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1103\/PhysRevA.45.763","volume":"45","author":"M Lewenstein","year":"1992","unstructured":"Lewenstein M, Nowak A, Latan\u00e9 B (1992) Statistical mechanics of social impact. Phys Rev A 45(2):763","journal-title":"Phys Rev A"},{"key":"1226_CR26","doi-asserted-by":"publisher","unstructured":"Matakos A, Aslay C, Galbrun E, Gionis A (2020) Maximizing the diversity of exposure in a social network. IEEE Trans Knowl Data Eng 34(9):4357\u20134370. https:\/\/doi.org\/10.1109\/TKDE.2020.3038711","DOI":"10.1109\/TKDE.2020.3038711"},{"issue":"10","key":"1226_CR27","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000959","volume":"6","author":"Michael Ms","year":"2010","unstructured":"Ms Michael, Andreas F, Dirk H (2010) Individualization as driving force of clustering phenomena in humans. PLoS Comput Biol 6(10):e1000959","journal-title":"PLoS Comput Biol"},{"key":"1226_CR28","doi-asserted-by":"publisher","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, Association for Computing Machinery, New York, NY, USA, SIGMOD \u201916, p 695-710, https:\/\/doi.org\/10.1145\/2882903.2915207","DOI":"10.1145\/2882903.2915207"},{"key":"1226_CR29","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 (2020) Recent advances in opinion propagation dynamics: a 2020 survey. Europ Phys J Plus 135:1\u201320","journal-title":"Europ Phys J Plus"},{"key":"1226_CR30","doi-asserted-by":"publisher","first-page":"568","DOI":"10.3390\/e25040568","volume":"25","author":"P Sobkowicz","year":"2023","unstructured":"Sobkowicz P (2023) Social depolarization and diversity of opinions-unified ABM framework. Entropy 25:568. https:\/\/doi.org\/10.3390\/e25040568","journal-title":"Entropy"},{"key":"1226_CR31","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.178701","volume":"94","author":"V Sood","year":"2005","unstructured":"Sood V, Redner S (2005) Voter model on heterogeneous graphs. Phys Rev Lett 94:178701. https:\/\/doi.org\/10.1103\/PhysRevLett.94.178701","journal-title":"Phys Rev Lett"},{"key":"1226_CR32","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1111\/1467-9760.00148","volume":"10","author":"C Sunstein","year":"2002","unstructured":"Sunstein C (2002) The law of group polarization. Journal of Political Philosophy 10:175\u2013195. https:\/\/doi.org\/10.1111\/1467-9760.00148","journal-title":"Journal of Political Philosophy"},{"issue":"4","key":"1226_CR33","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/moor.2016.0842","volume":"42","author":"M Sviridenko","year":"2017","unstructured":"Sviridenko M, Vondr\u00e1k J, Ward J (2017) Optimal approximation for submodular and supermodular optimization with bounded curvature. Math Oper Res 42(4):1197\u20131218. https:\/\/doi.org\/10.1287\/moor.2016.0842","journal-title":"Math Oper Res"},{"issue":"4","key":"1226_CR34","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 AM (2011) Phase transition in the Sznajd model with independence. Europhys Lett 96(4):48002. https:\/\/doi.org\/10.1209\/0295-5075\/96\/48002","journal-title":"Europhys Lett"},{"key":"1226_CR35","doi-asserted-by":"publisher","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, Association for Computing Machinery, New York, NY, USA, SIGMOD \u201918, p 991-1005, https:\/\/doi.org\/10.1145\/3183713.3183749,","DOI":"10.1145\/3183713.3183749"},{"key":"1226_CR36","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, Association for Computing Machinery, New York, NY, USA, SIGMOD \u201914, p 75-86","DOI":"10.1145\/2588555.2593670"},{"key":"1226_CR37","doi-asserted-by":"publisher","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, Association for Computing Machinery, New York, NY, USA, SIGMOD \u201915, p 1539-1554, https:\/\/doi.org\/10.1145\/2723372.2723734","DOI":"10.1145\/2723372.2723734"},{"key":"1226_CR38","doi-asserted-by":"publisher","unstructured":"Wang Y, Cong G, Song G, Xie K (2010) Community-based greedy algorithm for mining top-k influential nodes in mobile social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, New York, NY, USA, KDD \u201910, p 1039-1048, https:\/\/doi.org\/10.1145\/1835804.1835935","DOI":"10.1145\/1835804.1835935"},{"issue":"3","key":"1226_CR39","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/cplx.10031","volume":"7","author":"G Weisbuch","year":"2002","unstructured":"Weisbuch G, Deffuant G, Amblard F, Nadal JP (2002) Meet, discuss, and segregate! Complexity 7(3):55\u201363. https:\/\/doi.org\/10.1002\/cplx.10031","journal-title":"Complexity"},{"key":"1226_CR40","unstructured":"Wenruo B, Jeffrey AB (2018) Greed is still good: Maximizing monotone submodular+supermodular functions. CoRR abs\/1801.07413, arxiv:1801.07413,"},{"key":"1226_CR41","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. https:\/\/doi.org\/10.1016\/j.comnet.2017.05.004","journal-title":"Comput Netw"},{"key":"1226_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.113095","volume":"167","author":"Y Wu","year":"2023","unstructured":"Wu Y, Li L, Yu Q, Gan J, Zhang Y (2023) Strategies for reducing polarization in social networks. Chaos, Solitons and Fractals 167:113095. https:\/\/doi.org\/10.1016\/j.chaos.2022.113095","journal-title":"Chaos, Solitons and Fractals"},{"key":"1226_CR43","doi-asserted-by":"publisher","DOI":"10.1016\/j.techsoc.2022.101902","volume":"68","author":"Y Xing","year":"2022","unstructured":"Xing Y, Wang X, Qiu C, Li Y, He W (2022) Research on opinion polarization by big data analytics capabilities in online social networks. Technol Soc 68:101902. https:\/\/doi.org\/10.1016\/j.techsoc.2022.101902","journal-title":"Technol Soc"},{"key":"1226_CR44","doi-asserted-by":"publisher","unstructured":"Ya-Wen T, Chih-Hua T, Philip\u00a0S Y, Ming-Syan C (2018) Revenue maximization on the multi-grade product. In: Ester M, Pedreschi D (eds) Proceedings of the 2018 SIAM International Conference on Data Mining, SDM 2018, May 3-5, 2018, San Diego Marriott Mission Valley, San Diego, CA, USA, SIAM, pp 576\u2013584, https:\/\/doi.org\/10.1137\/1.9781611975321.65","DOI":"10.1137\/1.9781611975321.65"},{"key":"1226_CR45","doi-asserted-by":"publisher","unstructured":"Ye M, Liu X, Lee WC (2012) Exploring social influence for recommendation: A generative model approach. In: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, New York, NY, USA, SIGIR \u201912, p 671-680, https:\/\/doi.org\/10.1145\/2348283.2348373","DOI":"10.1145\/2348283.2348373"},{"issue":"10","key":"1226_CR46","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TKDE.2015.2419659","volume":"27","author":"C Zhou","year":"2015","unstructured":"Zhou C, Zhang P, Zang W, Guo L (2015) On the upper bounds of spread for greedy algorithms in social network influence maximization. IEEE Transac Knowl Data Eng 27(10):2770\u20132783. https:\/\/doi.org\/10.1109\/TKDE.2015.2419659","journal-title":"IEEE Transac Knowl Data Eng"},{"issue":"5","key":"1226_CR47","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 (2021) Influence maximization problem with echo chamber effect in social network. IEEE Trans Comput Soc Syst 8(5):1163\u20131171. https:\/\/doi.org\/10.1109\/TCSS.2021.3073064","journal-title":"IEEE Trans Comput Soc Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01226-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01226-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:24:10Z","timestamp":1732051450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01226-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,1]]},"references-count":47,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1226"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01226-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,11,1]]},"assertion":[{"value":"17 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 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":"All of the authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}],"article-number":"38"}}