{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T17:18:45Z","timestamp":1790961525813,"version":"4.1.0"},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T00:00:00Z","timestamp":1694476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given the adverse impact of fake news propagation on Social media, fake news mitigation has been one of the main research directions. However, existing approaches neglect fairness towards each community while minimizing the adverse impact of fake news propagation. This results in the exclusion of some minor and underrepresented communities from the benefits of the intervention, which can have important societal repercussions. This research proposes a fairness-aware truth-campaigning method, called FWRRS (<jats:bold>F<\/jats:bold>airness-aware <jats:bold>W<\/jats:bold>eighted <jats:bold>R<\/jats:bold>eversible <jats:bold>R<\/jats:bold>eachable <jats:bold>S<\/jats:bold>ystem), which focuses on blocking the influence propagation of a competing entity, in this case, with the use case of fake news mitigation. The proposed method employs weighted reversible reachable trees and maximin fairness to achieve its goals. Experimental analysis shows that FWRRS outperforms fairness-oblivious and fairness-aware methods in terms of both total outreach and fairness. The results show that in the proposed approach, such fairness does not come at a cost in efficiency, and in fact, in most cases, it works as a catalyst for achieving better effectiveness in the future. In real-world networks, we observe up to <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sim $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u223c<\/mml:mo>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>10% improvement in the saved nodes and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sim $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u223c<\/mml:mo>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>57% improvement in maximin fairness as compared to the second best-performing baseline, which varies for each network.<\/jats:p>","DOI":"10.1007\/s10489-023-04928-3","type":"journal-article","created":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T14:02:15Z","timestamp":1694527335000},"page":"27483-27504","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Fairness-aware fake news mitigation using counter information propagation"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7151-6309","authenticated-orcid":false,"given":"Akrati","family":"Saxena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cristina","family":"Guti\u00e9rrez Bierbooms","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mykola","family":"Pechenizkiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,12]]},"reference":[{"key":"4928_CR1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3120561","author":"J Ali","year":"2021","unstructured":"Ali J, Babaei M, Chakraborty A, Mirzasoleiman B, Gummadi K, Singla A (2021) On the Fairness of Time-Critical Influence Maximization in Social Networks. IEEE Trans Know Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2021.3120561","journal-title":"IEEE Trans Know Data Eng"},{"issue":"2","key":"4928_CR2","doi-asserted-by":"crossref","first-page":"205316801984855","DOI":"10.1177\/2053168019848554","volume":"6","author":"H Allcott","year":"2019","unstructured":"Allcott H, Gentzkow M, Yu C (2019) Trends in the diffusion of misinformation on social media. Res Polit 6(2):2053168019848554","journal-title":"Res Polit"},{"key":"4928_CR3","doi-asserted-by":"publisher","unstructured":"Arazkhani N, Meybodi MR, Rezvanian A (2019) Influence Blocking Maximization in Social Network Using Centrality Measures. 2019 IEEE 5th Conference on Knowledge Based Engineering and Innovation, KBEI. 2019 p 492\u2013497. https:\/\/doi.org\/10.1109\/KBEI.2019.8734920","DOI":"10.1109\/KBEI.2019.8734920"},{"key":"4928_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejpoleco.2022.102256","volume":"76","author":"M Azzimonti","year":"2023","unstructured":"Azzimonti M, Fernandes M (2023) Social media networks, fake news, and polarization. Eur J Political Econ 76:102256","journal-title":"Eur J Political Econ"},{"key":"4928_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.2139\/ssrn.2477899","volume":"671","author":"S Barocas","year":"2018","unstructured":"Barocas S, Selbst AD (2018) Big Data\u2019s Disparate Impact. SSRN Electron J 671:671\u2013732. https:\/\/doi.org\/10.2139\/ssrn.2477899","journal-title":"SSRN Electron J"},{"key":"4928_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jretconser.2021.102555","volume":"61","author":"A Bermes","year":"2021","unstructured":"Bermes A (2021) Information overload and fake news sharing: A transactional stress perspective exploring the mitigating role of consumers\u2019 resilience during covid-19. J Retail Consum Serv 61:102555","journal-title":"J Retail Consum Serv"},{"key":"4928_CR7","unstructured":"Bierbooms CG (2022) Fairness-aware influence blocking maximization for combating fake news"},{"issue":"10","key":"4928_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):1\u201312. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/P10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"1","key":"4928_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s13735-017-0143-x","volume":"7","author":"C Boididou","year":"2018","unstructured":"Boididou C, Papadopoulos S, Zampoglou M, Apostolidis L, Papadopoulou O, Kompatsiaris Y (2018) Detection and visualization of misleading content on twitter. Int J Multimed Inf Retr 7(1):71\u201386","journal-title":"Int J Multimed Inf Retr"},{"issue":"1","key":"4928_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1038\/s41467-018-07761-2","volume":"10","author":"A Bovet","year":"2019","unstructured":"Bovet A, Makse HA (2019) Influence of fake news in twitter during the 2016 us presidential election. Nat Commun 10(1):7","journal-title":"Nat Commun"},{"key":"4928_CR11","first-page":"37","volume":"2012","author":"U Brandes","year":"2010","unstructured":"Brandes U (2010) The Journal of Mathematical A faster algorithm for betweenness centrality. J Math Sociol 2012:37\u201341","journal-title":"J Math Sociol"},{"key":"4928_CR12","doi-asserted-by":"publisher","unstructured":"Budak C, Agrawal D, Abbadi AE (2011) Limiting the spread of misinformation in social networks. Proceedings of the 20th International Conference on World Wide Web, WWW 2011 pp. 665\u2013674. https:\/\/doi.org\/10.1145\/1963405.1963499","DOI":"10.1145\/1963405.1963499"},{"key":"4928_CR13","doi-asserted-by":"crossref","unstructured":"Capuano N, Fenza G, Loia V, Nota FD (2023) Content based fake news detection with machine and deep learning: a systematic review. Neurocomputing","DOI":"10.1016\/j.neucom.2023.02.005"},{"key":"4928_CR14","doi-asserted-by":"crossref","unstructured":"Castillo C, Mendoza M, Poblete B (2011) Information credibility on twitter. In: Proceedings of the 20th international conference on World wide web. p 675\u2013684","DOI":"10.1145\/1963405.1963500"},{"key":"4928_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101102","volume":"72","author":"BL Chen","year":"2022","unstructured":"Chen BL, Jiang WX, Yu YT, Zhou L, Tessone CJ (2022) Graph embedding based ant colony optimization for negative influence propagation suppression under cost constraints. Swarm Evol. Comput 72:101102","journal-title":"Swarm Evol. Comput"},{"key":"4928_CR16","unstructured":"Chen W Accessed on 20-Apr-2023 http:\/\/research.microsoft.com\/enus\/people\/weic\/graphdata.zip"},{"issue":"18\u201320","key":"4928_CR17","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1080\/10447318.2022.2062113","volume":"38","author":"SY Chien","year":"2022","unstructured":"Chien SY, Yang CJ, Yu F (2022) Xflag: Explainable fake news detection model on social media. Int. J. Hum.-Comput. Interact. 38(18\u201320):1808\u20131827","journal-title":"Int. J. Hum.-Comput. Interact."},{"issue":"1","key":"4928_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-020-73510-5","volume":"10","author":"M Cinelli","year":"2020","unstructured":"Cinelli M, Quattrociocchi W, Galeazzi A, Valensise CM, Brugnoli E, Schmidt AL, Zola P, Zollo F, Scala A (2020) The covid-19 social media infodemic. Sci Rep 10(1):1\u201310","journal-title":"Sci Rep"},{"issue":"6","key":"4928_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A Clauset","year":"2004","unstructured":"Clauset A, Newman ME, Moore C (2004) Finding community structure in very large networks. Phys Rev E - Stat Phys Plasm Fluids Rel Interdisc Topics 70(6):6. https:\/\/doi.org\/10.1103\/PhysRevE.70.066111","journal-title":"Phys Rev E - Stat Phys Plasm Fluids Rel Interdisc Topics"},{"key":"4928_CR20","volume-title":"Introduction to mathematical sociology","author":"JS Coleman","year":"1964","unstructured":"Coleman JS (1964) Introduction to mathematical sociology. Free Press of Glencoe, New York"},{"key":"4928_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.procs.2023.01.285","volume":"219","author":"F David","year":"2023","unstructured":"David F, Guimar\u00e3es N, Figueira \u00c1 (2023) A webapp for reliability detection in social media. Procedia Comput. Sci. 219:228\u2013235","journal-title":"Procedia Comput. Sci."},{"key":"4928_CR22","doi-asserted-by":"crossref","unstructured":"Dong Y, Ma J, Wang S, Chen C, Li J (2023) Fairness in graph mining: A survey. IEEE Trans Knowl Data Eng","DOI":"10.1109\/TKDE.2023.3265598"},{"key":"4928_CR23","doi-asserted-by":"crossref","unstructured":"Dou Y, Shu K, Xia C, Yu PS, Sun L(2021) User preference-aware fake news detection. In: Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval. p 2051\u20132055","DOI":"10.1145\/3404835.3462990"},{"key":"4928_CR24","first-page":"13609","volume":"33","author":"M El Halabi","year":"2020","unstructured":"El Halabi M, Mitrovi\u0107 S, Norouzi-Fard A, Tardos J, Tarnawski JM (2020) Fairness in streaming submodular maximization: Algorithms and hardness. Adv. Neural Inf. Process 33:13609\u201313622","journal-title":"Adv. Neural Inf. Process"},{"issue":"1","key":"4928_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-021-00765-9","volume":"11","author":"FC Erd","year":"2021","unstructured":"Erd FC, Vignatti AL, Silva MV (2021) The generalized influence blocking maximization problem. Soc Netw Anal Min 11(1):1\u201317","journal-title":"Soc Netw Anal Min"},{"issue":"2","key":"4928_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.76.026107","volume":"76","author":"G Fagiolo","year":"2007","unstructured":"Fagiolo G (2007) Clustering in complex directed networks. Phys Rev E - Stat Nonlinear Soft Matter Phys 76(2):1\u20138. https:\/\/doi.org\/10.1103\/PhysRevE.76.026107","journal-title":"Phys Rev E - Stat Nonlinear Soft Matter Phys"},{"key":"4928_CR27","doi-asserted-by":"publisher","unstructured":"Farnad G, Babaki B, Gendreau M (2020) A Unifying Framework for Fairness-Aware Influence Maximization. The Web Conference 2020 - Companion of the World Wide Web Conference, WWW 2020 (1), 714\u2013722. https:\/\/doi.org\/10.1145\/3366424.3383555","DOI":"10.1145\/3366424.3383555"},{"key":"4928_CR28","unstructured":"Gajane P, Pechenizkiy M (2017) On formalizing fairness in prediction with machine learning. arXiv:1710.03184"},{"key":"4928_CR29","doi-asserted-by":"crossref","unstructured":"Gupta Y, Saxena A, Das D, Iyengar S (2016) Modeling memetics using edge diversity. In: Complex networks VII, p 187\u2013198. Springer","DOI":"10.1007\/978-3-319-30569-1_14"},{"issue":"4","key":"4928_CR30","doi-asserted-by":"publisher","first-page":"6457","DOI":"10.1109\/JSYST.2022.3159840","volume":"16","author":"Q He","year":"2022","unstructured":"He Q, Lv Y, Wang X, Huang M, Cai Y (2022) Reinforcement learning-based rumor blocking approach in directed social networks. IEEE Syst J 16(4):6457\u20136467","journal-title":"IEEE Syst J"},{"key":"4928_CR31","doi-asserted-by":"crossref","unstructured":"He Q, Zhang D, Wang X, Ma L, Zhao Y, Gao F, Huang M(2022) Graph convolutional network-based rumor blocking on social networks. IEEE Trans Comput Soc Syst","DOI":"10.1109\/TCSS.2022.3188701"},{"key":"4928_CR32","doi-asserted-by":"publisher","unstructured":"He X, Song G, Chen W, Jiang Q(2012) Influence blocking maximization in social networks under the competitive linear threshold model. Proceedings of the 12th SIAM International Conference on Data Mining, SDM 2012 (October). 463\u2013474. https:\/\/doi.org\/10.1137\/1.9781611972825.40","DOI":"10.1137\/1.9781611972825.40"},{"key":"4928_CR33","doi-asserted-by":"crossref","unstructured":"Horne BD, Adali S(2017) This just in: fake news packs a lot in title, uses simpler, repetitive content in text body, more similar to satire than real news. In: Eleventh International AAAI Conference on Web and Social Media","DOI":"10.1609\/icwsm.v11i1.14976"},{"key":"4928_CR34","doi-asserted-by":"crossref","unstructured":"Hu L, Wei S, Zhao Z, Wu B(2022) Deep learning for fake news detection: A comprehensive survey. AI Open","DOI":"10.1016\/j.aiopen.2022.09.001"},{"key":"4928_CR35","doi-asserted-by":"crossref","unstructured":"Jiang J, Chen X, Huang Z, Li X, Du Y(2023) Deep reinforcement learning-based approach for rumor influence minimization in social networks. Appl Intell 1\u201318","DOI":"10.1007\/s10489-023-04555-y"},{"key":"4928_CR36","doi-asserted-by":"crossref","unstructured":"Jin Z, Cao J, Guo H, Zhang Y, Luo J(2017) Multimodal fusion with recurrent neural networks for rumor detection on microblogs. In: Proceedings of the 25th ACM international conference on Multimedia. p 795\u2013816","DOI":"10.1145\/3123266.3123454"},{"key":"4928_CR37","doi-asserted-by":"crossref","unstructured":"Kapadia P, Saxena A, Das B, Pei Y, Pechenizkiy M(2023) Co-attention based multi-contextual fake news detection. In: Complex Networks XIII: Proceedings of the 13th Conference on Complex Networks, CompleNet 2022. Springer, p 83\u201395","DOI":"10.1007\/978-3-031-17658-6_7"},{"issue":"1","key":"4928_CR38","doi-asserted-by":"publisher","first-page":"11077","DOI":"10.1038\/s41598-018-29405-7","volume":"8","author":"F Karimi","year":"2018","unstructured":"Karimi F, G\u00e9nois M, Wagner C, Singer P, Strohmaier M (2018) Homophily influences ranking of minorities in social networks. Sci Rep 8(1):11077","journal-title":"Sci Rep"},{"key":"4928_CR39","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J(2003) Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. p 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"4928_CR40","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, p 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"4928_CR41","doi-asserted-by":"publisher","first-page":"11963","DOI":"10.1609\/aaai.v36i11.21454","volume":"36","author":"A Khajehnejad","year":"2022","unstructured":"Khajehnejad A, Khajehnejad M, Babaei M, Gummadi KP, Weller A, Mirzasoleiman B (2022) Crosswalk: Fairness-enhanced node representation learning. Proceedings of the AAAI Conference on Artificial Intelligence 36:11963\u201311970","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"4928_CR42","doi-asserted-by":"crossref","unstructured":"Kimura M, Saito K(2006) Tractable models for information diffusion in social networks. In: Knowledge Discovery in Databases: PKDD 2006: 10th European Conference on Principles and Practice of Knowledge Discovery in Databases Berlin, Germany, September 18-22, 2006 Proceedings 10. Springer, p 259\u2013271","DOI":"10.1007\/11871637_27"},{"key":"4928_CR43","unstructured":"Klimt B, Yang Y(2004) Introducing the Enron Corpus. Machine Learning"},{"key":"4928_CR44","doi-asserted-by":"crossref","unstructured":"Kumar P, Devi PR, Sai NR, Kumar SS, Benarji T (2021) Battling fake news: A survey on mitigation techniques and identification. In: 2021 5th international conference on trends in electronics and informatics (ICOEI). IEEE, p 829\u2013835","DOI":"10.1109\/ICOEI51242.2021.9452829"},{"key":"4928_CR45","unstructured":"Kwan R(2023) Breaking news: Social media changed the way we consume news. Accessed on 20-Apr-2023"},{"key":"4928_CR46","unstructured":"Lee CE, Kent JL(2023) Facebook says russian-backed election content reached 126 million americans. Accessed on 20-Apr-2023"},{"issue":"10","key":"4928_CR47","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1038\/s41562-019-0677-4","volume":"3","author":"E Lee","year":"2019","unstructured":"Lee E, Karimi F, Wagner C, Jo HH, Strohmaier M, Galesic M (2019) Homophily and minority-group size explain perception biases in social networks. Nat Hum Behav 3(10):1078\u20131087","journal-title":"Nat Hum Behav"},{"key":"4928_CR48","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2007) Graph evolution: Densification and shrinking diameters. ACM Trans Know Disc Data 1(1):2\u2013es","DOI":"10.1145\/1217299.1217301"},{"issue":"3","key":"4928_CR49","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1177\/1529100612451018","volume":"13","author":"S Lewandowsky","year":"2012","unstructured":"Lewandowsky S, Ecker UK, Seifert CM, Schwarz N, Cook J (2012) Misinformation and its correction: Continued influence and successful debiasing. Psychol Sci Public Int 13(3):106\u2013131","journal-title":"Psychol Sci Public Int"},{"key":"4928_CR50","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick SS, Sun A, Cui J (2015) Conformity-aware influence maximization in online social networks. VLDB Journal 24:117\u2013141","journal-title":"VLDB Journal"},{"key":"4928_CR51","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1609\/icwsm.v16i1.19321","volume":"16","author":"Y Li","year":"2022","unstructured":"Li Y, Wang X, Ning Y, Wang H (2022) Fairlp: Towards fair link prediction on social network graphs. Proceedings of the International AAAI Conference on Web and Social Media 16:628\u2013639","journal-title":"Proceedings of the International AAAI Conference on Web and Social Media"},{"key":"4928_CR52","volume-title":"BIOG: An Effective and efficient algorithm for influence blocking maximization in social networks","author":"KS Lin","year":"2019","unstructured":"Lin KS, Dai BR (2019) BIOG: An Effective and efficient algorithm for influence blocking maximization in social networks, vol 1071. Springer, Singapore"},{"key":"4928_CR53","doi-asserted-by":"crossref","unstructured":"Lu YJ, Li CT(2020) Gcan: Graph-aware co-attention networks for explainable fake news detection on social media. In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, p 505\u2013514","DOI":"10.18653\/v1\/2020.acl-main.48"},{"issue":"s3","key":"4928_CR54","doi-asserted-by":"publisher","first-page":"5587","DOI":"10.1007\/s10586-017-1390-6","volume":"22","author":"J Lv","year":"2019","unstructured":"Lv J, Yang B, Yang Z, Zhang W (2019) A community-based algorithm for influence blocking maximization in social networks. Cluster Comput 22(s3):5587\u20135602","journal-title":"Cluster Comput"},{"key":"4928_CR55","doi-asserted-by":"publisher","unstructured":"Masrour F, Wilson T, Yan H, Tan PN, Esfahanian AH(2020) Bursting the filter bubble: Fairness-aware network link prediction. AAAI 2020 - 34th AAAI Conference on Artificial Intelligence. p 841\u2013848. https:\/\/doi.org\/10.1609\/aaai.v34i01.5429","DOI":"10.1609\/aaai.v34i01.5429"},{"key":"4928_CR56","unstructured":"Mcauley J, Leskovec J(2012) Learning to Discover Social Circles in Ego Networks. NIPS, p 1\u20139"},{"key":"4928_CR57","doi-asserted-by":"crossref","unstructured":"Mendoza M, Poblete B, Castillo C(2010) Twitter under crisis: Can we trust what we rt? In: Proceedings of the first workshop on social media analytics. p 71\u201379","DOI":"10.1145\/1964858.1964869"},{"issue":"7","key":"4928_CR58","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1587\/transinf.2021EDR0003","volume":"105","author":"K Mishima","year":"2022","unstructured":"Mishima K, Yamana H (2022) A survey on explainable fake news detection. IEICE Trans Inf Syst 105(7):1249\u20131257","journal-title":"IEICE Trans Inf Syst"},{"key":"4928_CR59","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.engappai.2015.02.007","volume":"41","author":"R Mohamadi-Baghmolaei","year":"2015","unstructured":"Mohamadi-Baghmolaei R, Mozafari N, Hamzeh A (2015) Trust based latency aware influence maximization in social networks. Eng. Appl. Artif. Intell 41:195\u2013206","journal-title":"Eng. Appl. Artif. Intell"},{"key":"4928_CR60","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. Proc. ACM SIGMOD Int. Conf. Manag Data 26-June-20, 695\u2013710. https:\/\/doi.org\/10.1145\/2882903.2915207","DOI":"10.1145\/2882903.2915207"},{"key":"4928_CR61","unstructured":"Nisbet EC, Beck P, Gunther R(2018) \u201cTrump May Owe His 2016 Victory to \u2018Fake News\u2019, New Study Suggests,\". The Conversation"},{"key":"4928_CR62","unstructured":"O\u2019Brien N, Latessa S, Evangelopoulos G, Boix X(2018) The language of fake news: Opening the black-box of deep learning based detectors"},{"key":"4928_CR63","doi-asserted-by":"crossref","unstructured":"Pennycook G, Rand DG(2018) Who falls for fake news? the roles of bullshit receptivity, overclaiming, familiarity, and analytic thinking. SSRN Electron J","DOI":"10.1111\/jopy.12476"},{"key":"4928_CR64","doi-asserted-by":"publisher","unstructured":"Piraveenan M, Prokopenko M, Hossain L(2013) Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks. PLoS ONE 8(1) https:\/\/doi.org\/10.1371\/journal.pone.0053095","DOI":"10.1371\/journal.pone.0053095"},{"issue":"2","key":"4928_CR65","doi-asserted-by":"publisher","first-page":"191","DOI":"10.7155\/jgaa.00124","volume":"10","author":"P Pons","year":"2006","unstructured":"Pons P, Latapy M (2006) Computing communities in large networks using random walks. J. Graph Algorithms Appl. 10(2):191\u2013218. https:\/\/doi.org\/10.7155\/jgaa.00124","journal-title":"J. Graph Algorithms Appl."},{"key":"4928_CR66","doi-asserted-by":"crossref","unstructured":"Potthast M, Kiesel J, Reinartz K, Bevendorff J, Stein B(2018) A stylometric inquiry into hyperpartisan and fake news. In: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). p 231\u2013240","DOI":"10.18653\/v1\/P18-1022"},{"key":"4928_CR67","doi-asserted-by":"crossref","unstructured":"Qi P, Cao J, Yang T, Guo J, Li J(2019) Exploiting multi-domain visual information for fake news detection. In: 2019 IEEE International Conference on Data Mining (ICDM). IEEE , p 518\u2013527","DOI":"10.1109\/ICDM.2019.00062"},{"issue":"3","key":"4928_CR68","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E - Stat Nonlin Soft Matter Phys 76(3):1\u201312. https:\/\/doi.org\/10.1103\/PhysRevE.76.036106","journal-title":"Phys Rev E - Stat Nonlin Soft Matter Phys"},{"key":"4928_CR69","doi-asserted-by":"crossref","unstructured":"Rocha YM, de\u00a0Moura GA, Desid\u00e9rio GA, de\u00a0Oliveira CH, Louren\u00e7o FD, de\u00a0Figueiredo\u00a0Nicolete LD(2021) The impact of fake news on social media and its influence on health during the covid-19 pandemic: A systematic review. J Public Health 1\u201310","DOI":"10.1007\/s10389-021-01658-z"},{"issue":"4","key":"4928_CR70","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1073\/pnas.0706851105","volume":"105","author":"M Rosvall","year":"2008","unstructured":"Rosvall M, Bergstrom CT (2008) Maps of random walks on complex networks reveal community structure. Proc Natl Acad Sci U S A 105(4):1118\u20131123. https:\/\/doi.org\/10.1073\/pnas.0706851105","journal-title":"Proc Natl Acad Sci U S A"},{"key":"4928_CR71","unstructured":"Rubin VL, Conroy NJ, Chen Y(2015) Towards news verification: Deception detection methods for news discourse. In: Hawaii International Conference on System Sciences. p 5\u20138"},{"key":"4928_CR72","doi-asserted-by":"crossref","unstructured":"Saxena A, Fletcher G, Pechenizkiy M (2021) Hm-eiict: Fairness-aware link prediction in complex networks using community information. J. Comb. Optim 1\u201318","DOI":"10.1007\/s10878-021-00788-0"},{"key":"4928_CR73","unstructured":"Saxena A, Fletcher G, Pechenizkiy M(2022) Fairsna: Algorithmic fairness in social network analysis.arXiv:2209.01678"},{"issue":"1","key":"4928_CR74","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1140\/epjds\/s13688-022-00336-8","volume":"11","author":"A Saxena","year":"2022","unstructured":"Saxena A, Fletcher G, Pechenizkiy M (2022) Nodesim: node similarity based network embedding for diverse link prediction. EPJ Data Sci 11(1):24","journal-title":"EPJ Data Sci"},{"key":"4928_CR75","first-page":"363","volume":"2020","author":"A Saxena","year":"2020","unstructured":"Saxena A, Hsu W, Lee ML, Leong Chieu H, Ng L, Teow LN (2020) Mitigating misinformation in online social network with top-k debunkers and evolving user opinions. Companion proceedings of the web conference 2020:363\u2013370","journal-title":"Companion proceedings of the web conference"},{"key":"4928_CR76","unstructured":"Saxena A, Iyengar S(2020) Centrality measures in complex networks: A survey. arXiv:2011.07190"},{"key":"4928_CR77","doi-asserted-by":"crossref","unstructured":"Saxena A, Iyengar S, Gupta Y(2015) Understanding spreading patterns on social networks based on network topology. In: Proceedings of the 2015 IEEE\/ACM international conference on advances in social networks analysis and mining 2015, p 1616\u20131617","DOI":"10.1145\/2808797.2809360"},{"key":"4928_CR78","doi-asserted-by":"crossref","unstructured":"Saxena A, Saxena H, Gera R(2020) k-truthscore: Fake news mitigation in the presence of strong user bias. In: International Conference on Computational Data and Social Networks. Springer, p 113\u2013126","DOI":"10.1007\/978-3-030-66046-8_10"},{"key":"4928_CR79","doi-asserted-by":"crossref","unstructured":"Saxena A, Saxena P, Reddy H(2022) Fake news detection techniques for social media. In: Principles of Social Networking. Springer, p 325\u2013354","DOI":"10.1007\/978-981-16-3398-0_15"},{"key":"4928_CR80","doi-asserted-by":"crossref","unstructured":"Saxena A, Saxena P, Reddy H(2022) Fake news propagation and mitigation techniques: A survey. In: Principles of Social Networking. Springer, p 355\u2013386","DOI":"10.1007\/978-981-16-3398-0_16"},{"key":"4928_CR81","doi-asserted-by":"crossref","unstructured":"Seifert CM(2002) The continued influence of misinformation in memory: What makes a correction effective? In: Psychology of learning and motivation, vol.\u00a041. Elsevier, p 265\u2013292","DOI":"10.1016\/S0079-7421(02)80009-3"},{"issue":"3","key":"4928_CR82","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3305260","volume":"10","author":"K Sharma","year":"2019","unstructured":"Sharma K, Qian F, Jiang H, Ruchansky N, Zhang M, Liu Y (2019) Combating fake news: A survey on identification and mitigation techniques. ACM Trans. Intell. Syst. Technol. 10(3):1\u201342","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"4928_CR83","doi-asserted-by":"crossref","unstructured":"Shu K, Cui L, Wang S, Lee D, Liu H(2019) defend: Explainable fake news detection. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. p 395\u2013405","DOI":"10.1145\/3292500.3330935"},{"key":"4928_CR84","doi-asserted-by":"crossref","unstructured":"Shu K, Wang S, Liu H(2019) Beyond news contents: The role of social context for fake news detection. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining. p 312\u2013320","DOI":"10.1145\/3289600.3290994"},{"key":"4928_CR85","doi-asserted-by":"publisher","unstructured":"Song, C., Hsu, W., Lee, M.L(2017) Temporal influence blocking: Minimizing the effect of misinformation in social networks. Proceedings - International Conference on Data Engineering p 847\u2013858 https:\/\/doi.org\/10.1109\/ICDE.2017.134","DOI":"10.1109\/ICDE.2017.134"},{"key":"4928_CR86","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/3308560.3317588","volume":"2019","author":"AA Stoica","year":"2019","unstructured":"Stoica AA, Chaintreau A (2019) Fairness in social influence maximization. The Web Conference 2019 - Companion of the World Wide Web Conference. WWW 2019:569\u2013574. https:\/\/doi.org\/10.1145\/3308560.3317588","journal-title":"WWW"},{"key":"4928_CR87","doi-asserted-by":"publisher","unstructured":"Stoica AA, Han JX, Chaintreau A(2020) Seeding Network Influence in Biased Networks and the Benefits of Diversity. The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 2, 2089\u20132098. https:\/\/doi.org\/10.1145\/3366423.3380275","DOI":"10.1145\/3366423.3380275"},{"key":"4928_CR88","unstructured":"Tacchini E, Ballarin G, Della\u00a0Vedova ML, Moret S, de\u00a0Alfaro L, et\u00a0al (2017) Some like it hoax: Automated fake news detection in social networks. In: CEUR Workshop Proceedings. CEUR-WS, p 1\u201315"},{"key":"4928_CR89","doi-asserted-by":"crossref","unstructured":"Tsang A, Wilder B, Rice E, Tambe M, Zick Y(2019) Group-fairness in influence maximization. IJCAI International Joint Conference on Artificial Intelligence. p 5997\u20136005","DOI":"10.24963\/ijcai.2019\/831"},{"key":"4928_CR90","first-page":"3815","volume":"2021","author":"S Tsioutsiouliklis","year":"2021","unstructured":"Tsioutsiouliklis S, Pitoura E, Tsaparas P, Kleftakis I, Mamoulis N (2021) Fairness-aware pagerank. Proceedings of the Web Conference 2021:3815\u20133826","journal-title":"Proceedings of the Web Conference"},{"issue":"4","key":"4928_CR91","first-page":"50","volume":"11","author":"S Vosoughi","year":"2017","unstructured":"Vosoughi S, Mohsenvand M, Roy D (2017) Rumor gauge: predicting the veracity of rumors on twitter. ACM Trans Knowl Discov 11(4):50","journal-title":"ACM Trans Knowl Discov"},{"issue":"6380","key":"4928_CR92","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1126\/science.aap9559","volume":"359","author":"S Vosoughi","year":"2018","unstructured":"Vosoughi S, Roy D, Aral S (2018) The spread of true and false news online. Science 359(6380):1146\u20131151","journal-title":"Science"},{"key":"4928_CR93","unstructured":"Wang X, Deng K, Li J, Yu JX, Jensen CS, Yang X (2018) Targeted influence minimization in social networks., vol.\u00a023. Springer International Publishing"},{"key":"4928_CR94","doi-asserted-by":"crossref","unstructured":"Wu P, Pan L (2017) Scalable influence blocking maximization in social networks under competitive independent cascade models. Comput Netw 123:38\u201350","DOI":"10.1016\/j.comnet.2017.05.004"},{"key":"4928_CR95","doi-asserted-by":"publisher","unstructured":"Yao C, Zhang Y, Zhang X, Bian K, Song L(2019) Competitive influence blocking in online social networks: A case study on WeChat. 2018 24th Asia-Pacific Conference on Communications, APCC 2018 pp. 251\u2013256. https:\/\/doi.org\/10.1109\/APCC.2018.8633553","DOI":"10.1109\/APCC.2018.8633553"},{"key":"4928_CR96","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139088510","volume-title":"Social media mining: an introduction","author":"R Zafarani","year":"2014","unstructured":"Zafarani R, Abbasi MA, Liu H (2014) Social media mining: an introduction. Cambridge University Press"},{"key":"4928_CR97","doi-asserted-by":"publisher","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"},{"key":"4928_CR98","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1007\/s11280-018-0623-9","volume":"22","author":"P Zhang","year":"2019","unstructured":"Zhang P, Bao Z, Niu Y, Zhang Y, Mo S, Geng F, Peng Z (2019) Proactive rumor control in online networks. World Wide Web 22:1799\u20131818","journal-title":"World Wide Web"},{"key":"4928_CR99","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2022.128096","volume":"607","author":"Y Zhang","year":"2022","unstructured":"Zhang Y, Xu J, Nekovee M, Li Z (2022) The impact of official rumor-refutation information on the dynamics of rumor spread. Physica A: Stat Mech Appl 607:128096","journal-title":"Physica A: Stat Mech Appl"},{"key":"4928_CR100","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.ins.2014.03.070","volume":"278","author":"T Zhu","year":"2014","unstructured":"Zhu T, Wang B, Wu B, Zhu C (2014) Maximizing the spread of influence ranking in social networks. Inf Sci 278:535\u2013544","journal-title":"Inf Sci"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04928-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04928-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04928-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T23:16:23Z","timestamp":1698275783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04928-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,12]]},"references-count":100,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["4928"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04928-3","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,12]]},"assertion":[{"value":"29 July 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 September 2023","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 declare that there is not any conflict of interest in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}