{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T10:09:53Z","timestamp":1755598193555,"version":"3.37.3"},"reference-count":113,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T00:00:00Z","timestamp":1664668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T00:00:00Z","timestamp":1664668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["2006765","1813444"],"award-info":[{"award-number":["2006765","1813444"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1740741"],"award-info":[{"award-number":["1740741"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["788893"],"award-info":[{"award-number":["788893"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s10618-022-00875-8","type":"journal-article","created":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T01:03:06Z","timestamp":1664672586000},"page":"2334-2378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights"],"prefix":"10.1007","volume":"36","author":[{"given":"Shahrzad","family":"Haddadan","sequence":"first","affiliation":[]},{"given":"Cristina","family":"Menghini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2523-4420","authenticated-orcid":false,"given":"Matteo","family":"Riondato","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,2]]},"reference":[{"key":"875_CR1","doi-asserted-by":"publisher","unstructured":"Adamic LA, Glance N (2005) The political blogosphere and the 2004 U.S. election: divided they blog. In: Proceedings of the 3rd international workshop on Link Discovery, LinkKDD \u201905. Association for Computing Machinery, New York, pp 36\u201343. https:\/\/doi.org\/10.1145\/1134271.1134277","DOI":"10.1145\/1134271.1134277"},{"key":"875_CR2","doi-asserted-by":"crossref","unstructured":"Akoglu L (2014) Quantifying political polarity based on bipartite opinion networks. In: Eighth international AAAI conference on weblogs and social media","DOI":"10.1609\/icwsm.v8i1.14524"},{"key":"875_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/3340531.3412036","volume-title":"Spectral relaxations and fair densest subgraphs","author":"A Anagnostopoulos","year":"2020","unstructured":"Anagnostopoulos A, Becchetti L, Fazzone A, Menghini C, Schwiegelshohn C (2020) Spectral relaxations and fair densest subgraphs. Association for Computing Machinery, New York, pp 35\u201344. https:\/\/doi.org\/10.1145\/3340531.3412036"},{"key":"875_CR4","doi-asserted-by":"crossref","unstructured":"Angriman E, van\u00a0der Grinten A, Bojchevski A, Z\u00fcgner D, G\u00fcnnemann S, Meyerhenke H (2020) Group centrality maximization for large-scale graphs. In: 2020 Proceedings of the twenty-second workshop on Algorithm Engineering and Experiments (ALENEX)","DOI":"10.1137\/1.9781611976007.5"},{"key":"875_CR5","doi-asserted-by":"publisher","unstructured":"Aridor G, Goncalves D, Sikdar S (2020) Deconstructing the filter bubble: user decision-making and recommender systems. In: Fourteenth ACM conference on recommender systems, RecSys \u201920. Association for Computing Machinery, New York, pp 82\u201391. https:\/\/doi.org\/10.1145\/3383313.3412246","DOI":"10.1145\/3383313.3412246"},{"issue":"1","key":"875_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/15M1034131","volume":"37","author":"F Arrigo","year":"2016","unstructured":"Arrigo F, Benzi M (2016a) Edge modification criteria for enhancing the communicability of digraphs. SIAM J Matrix Anal Appl 37(1):443\u2013468","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"1","key":"875_CR7","doi-asserted-by":"publisher","first-page":"B25","DOI":"10.1137\/140991923","volume":"38","author":"F Arrigo","year":"2016","unstructured":"Arrigo F, Benzi M (2016b) Updating and downdating techniques for optimizing network communicability. SIAM J Sci Comput 38(1):B25\u2013B49","journal-title":"SIAM J Sci Comput"},{"key":"875_CR8","doi-asserted-by":"crossref","unstructured":"Aslay C, Matakos A, Galbrun E, Gionis A (2018) Maximizing the diversity of exposure in a social network. In: 2018 IEEE International Conference on Data Mining (ICDM), pp 863\u2013868","DOI":"10.1109\/ICDM.2018.00102"},{"key":"875_CR9","doi-asserted-by":"publisher","unstructured":"Baeza-Yates R (2020) Bias in search and recommender systems. In: Fourteenth ACM Conference on Recommender Systems, RecSys \u201920. Association for Computing Machinery, New York, p 2. https:\/\/doi.org\/10.1145\/3383313.3418435","DOI":"10.1145\/3383313.3418435"},{"issue":"6239","key":"875_CR10","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1126\/science.aaa1160","volume":"348","author":"E Bakshy","year":"2015","unstructured":"Bakshy E, Messing S, Adamic LA (2015) Exposure to ideologically diverse news and opinion on Facebook. Science 348(6239):1130\u20131132","journal-title":"Science"},{"key":"875_CR11","doi-asserted-by":"crossref","unstructured":"Becker R, Cor\u00f2 F, D\u2019Angelo G, Gilbert H (2020) Balancing spreads of influence in a social network. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, no 1, pp 3\u201310","DOI":"10.1609\/aaai.v34i01.5327"},{"key":"875_CR12","doi-asserted-by":"crossref","unstructured":"Ben-Hamou A, Oliveira RI, Peres Y (2018) Estimating graph parameters via random walks with restarts. In: Proceedings of the twenty-ninth annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201918. Society for Industrial and Applied Mathematics, USA, pp 1702\u20131714","DOI":"10.1137\/1.9781611975031.111"},{"key":"875_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1515\/9780691234168-005","volume-title":"Democracy and difference: contesting the boundaries of the political","author":"S Benhabib","year":"1996","unstructured":"Benhabib S (1996) Toward a deliberative model of democratic legitimacy. Democracy and difference: contesting the boundaries of the political. Princeton University Press, Princeton, pp 67\u201394"},{"key":"875_CR14","doi-asserted-by":"publisher","unstructured":"Bera SK, Seshadhri C (2020) How to count triangles, without seeing the whole graph. In: Proceedings of the 26th ACM SIGKDD international conference on Knowledge Discovery & Data Mining, KDD \u201920. Association for Computing Machinery, New York, pp 306\u2013316. https:\/\/doi.org\/10.1145\/3394486.3403073","DOI":"10.1145\/3394486.3403073"},{"key":"875_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3166071","volume":"23","author":"E Bergamini","year":"2018","unstructured":"Bergamini E, Crescenzi P, D\u2019Angelo G, Meyerhenke H, Severini L, Velaj Y (2018) Improving the betweenness centrality of a node by adding links. J Exp Algorithmics (JEA) 23:1\u201332","journal-title":"J Exp Algorithmics (JEA)"},{"key":"875_CR16","doi-asserted-by":"publisher","unstructured":"Biega AJ, Gummadi KP, Weikum G (2018) Equity of attention: amortizing individual fairness in rankings. In: The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval, SIGIR \u201918. Association for Computing Machinery, New York, pp 405\u2013414. https:\/\/doi.org\/10.1145\/3209978.3210063","DOI":"10.1145\/3209978.3210063"},{"issue":"1","key":"875_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1080\/0022250X.2020.1818078","volume":"46","author":"C Blex","year":"2022","unstructured":"Blex C, Yasseri T (2022) Positive algorithmic bias cannot stop fragmentation in homophilic networks. J Math Sociol 46(1):80\u201397","journal-title":"J Math Sociol"},{"issue":"1","key":"875_CR18","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1613\/jair.1.11259","volume":"63","author":"J Camacho-Collados","year":"2018","unstructured":"Camacho-Collados J, Pilehvar MT (2018) From word to sense embeddings: a survey on vector representations of meaning. J Artif Intell Res 63(1):743\u2013788. https:\/\/doi.org\/10.1613\/jair.1.11259","journal-title":"J Artif Intell Res"},{"key":"875_CR19","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-1-4899-7637-6_26","volume-title":"Novelty and diversity in recommender systems","author":"P Castells","year":"2015","unstructured":"Castells P, Hurley NJ, Vargas S (2015) Novelty and diversity in recommender systems. Springer, Boston, pp 881\u2013918. https:\/\/doi.org\/10.1007\/978-1-4899-7637-6_26"},{"issue":"2","key":"875_CR20","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/TEVC.2013.2260548","volume":"18","author":"J Ceberio","year":"2014","unstructured":"Ceberio J, Irurozki E, Mendiburu A, Lozano JA (2014) A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans Evol Comput 18(2):286\u2013300. https:\/\/doi.org\/10.1109\/TEVC.2013.2260548","journal-title":"IEEE Trans Evol Comput"},{"key":"875_CR21","unstructured":"Celis LE, Straszak D, Vishnoi NK (2017) Ranking with fairness constraints. arXiv preprint arXiv:1704.06840"},{"key":"875_CR22","doi-asserted-by":"crossref","unstructured":"Celis LE, Kapoor S, Salehi F, Vishnoi N (2019) Controlling polarization in personalization: an algorithmic framework. In: Proceedings of the conference on fairness, accountability, and transparency, pp 160\u2013169","DOI":"10.1145\/3287560.3287601"},{"key":"875_CR23","doi-asserted-by":"crossref","unstructured":"Chan H, Akoglu L, Tong H (2014) Make it or break it: manipulating robustness in large networks. In: Proceedings of the 2014 SIAM international conference on data mining. SIAM, pp 325\u2013333","DOI":"10.1137\/1.9781611973440.37"},{"key":"875_CR24","unstructured":"Chierichetti F, Haddadan S (2018) On the complexity of sampling vertices uniformly from a graph. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018"},{"key":"875_CR25","unstructured":"Chierichetti F, Dasgupta A, Haddadan S, Kumar R, Lattanzi S (2018) Mallows models for top-k lists. In: Proceedings of the 32nd international conference on Neural Information Processing Systems, NIPS\u201918. Curran Associates Inc., Red Hook, pp 4387\u20134397"},{"key":"875_CR26","doi-asserted-by":"crossref","unstructured":"Chitra U, Musco C (2020) Analyzing the impact of filter bubbles on social network polarization. In: Proceedings of the 13th international conference on web search and data mining. ACM","DOI":"10.1145\/3336191.3371825"},{"key":"875_CR27","unstructured":"Collins A, Tkaczyk D, Aizawa A, Beel J (2018) A study of position bias in digital library recommender systems. arXiv preprint arXiv:1802.06565"},{"key":"875_CR28","unstructured":"Conover MD, Ratkiewicz J, Francisco M, Gon\u00e7alves B, Menczer F, Flammini A (2011) Political polarization on Twitter. In: Fifth international AAAI conference on weblogs and social media"},{"key":"875_CR29","doi-asserted-by":"crossref","unstructured":"Cossard A, De\u00a0Francisci\u00a0Morales G, Kalimeri K, Mejova Y, Paolotti D, Starnini M (2020) Falling into the echo chamber: the Italian vaccination debate on Twitter. In: Proceedings of the International AAAI conference on web and social media","DOI":"10.1609\/icwsm.v14i1.7285"},{"key":"875_CR30","doi-asserted-by":"publisher","unstructured":"Craswell N, Zoeter O, Taylor M, Ramsey B (2008) An experimental comparison of click position-bias models. In: Proceedings of the 2008 international conference on Web Search and Data Mining, WSDM \u201908. Association for Computing Machinery, New York, pp 87\u201394. https:\/\/doi.org\/10.1145\/1341531.1341545","DOI":"10.1145\/1341531.1341545"},{"key":"875_CR31","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo G, Olsen M, Severini L (2019) Coverage centrality maximization in undirected networks. In: Proceedings of the AAAI conference on artificial intelligence, vol 33, pp 501\u2013508","DOI":"10.1609\/aaai.v33i01.3301501"},{"key":"875_CR32","doi-asserted-by":"crossref","unstructured":"Das A, Gollapudi S, Munagala K (2014) Modeling opinion dynamics in social networks. In: Proceedings of the 7th ACM international conference on Web search and data mining, pp 403\u2013412","DOI":"10.1145\/2556195.2559896"},{"key":"875_CR33","doi-asserted-by":"publisher","unstructured":"Dasgupta A, Kumar R, Sarlos T (2014) On estimating the average degree. In: Proceedings of the 23rd international conference on World Wide Web, WWW \u201914. Association for Computing Machinery, New York, pp 795\u2013806. https:\/\/doi.org\/10.1145\/2566486.2568019","DOI":"10.1145\/2566486.2568019"},{"key":"875_CR34","doi-asserted-by":"crossref","unstructured":"Demaine ED, Zadimoghaddam M (2010) Minimizing the diameter of a network using shortcut edges. In: Scandinavian workshop on algorithm theory. Springer, pp 420\u2013431","DOI":"10.1007\/978-3-642-13731-0_39"},{"key":"875_CR35","doi-asserted-by":"publisher","unstructured":"Dimitrov D, Singer P, Lemmerich F, Strohmaier M (2017) What makes a link successful on Wikipedia? In: Proceedings of the 26th international conference on World Wide Web, International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, CHE, WWW \u201917, pp 917\u2013926. https:\/\/doi.org\/10.1145\/3038912.3052613","DOI":"10.1145\/3038912.3052613"},{"key":"875_CR36","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1137\/S0895480102408341","volume":"16","author":"I Dumitriu","year":"2003","unstructured":"Dumitriu I, Tetali P, Winkler P (2003) On playing golf with two balls. SIAM J Discrete Math 16:604\u2013615","journal-title":"SIAM J Discrete Math"},{"key":"875_CR37","doi-asserted-by":"crossref","unstructured":"Fagin R, Karlin A, Kleinberg J, Raghavan P, Rajagopalan S, Rubinfeld R, Tomkins A (2001) Random walks with \"back buttons\". Ann Appl Probab 11","DOI":"10.1214\/aoap\/1015345350"},{"key":"875_CR38","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856","author":"R Fagin","year":"2002","unstructured":"Fagin R, Kumar R, Sivakumar D (2002) Comparing top k lists. SIAM J Discrete Math. https:\/\/doi.org\/10.1137\/S0895480102412856","journal-title":"SIAM J Discrete Math"},{"issue":"S1","key":"875_CR39","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1093\/poq\/nfw006","volume":"80","author":"S Flaxman","year":"2016","unstructured":"Flaxman S, Goel S, Rao JM (2016) Filter bubbles, echo chambers, and online news consumption. Public Opin Q 80(S1):298\u2013320","journal-title":"Public Opin Q"},{"issue":"3","key":"875_CR40","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1111\/j.2517-6161.1986.tb01420.x","volume":"48","author":"MA Fligner","year":"1986","unstructured":"Fligner MA, Verducci JS (1986) Distance based ranking models. J R Stat Soc Ser B (Methodol) 48(3):359\u2013369","journal-title":"J R Stat Soc Ser B (Methodol)"},{"issue":"3","key":"875_CR41","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F Fouss","year":"2007","unstructured":"Fouss F, Pirotte A, Jm R, Saerens M (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355\u2013369. https:\/\/doi.org\/10.1109\/TKDE.2007.46","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"875_CR42","doi-asserted-by":"publisher","unstructured":"Fu Z, Xian Y, Gao R, Zhao J, Huang Q, Ge Y, Xu S, Geng S, Shah C, Zhang Y, de\u00a0Melo G (2020) Fairness-aware explainable recommendation over knowledge graphs. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM. https:\/\/doi.org\/10.1145\/3397271.3401051","DOI":"10.1145\/3397271.3401051"},{"key":"875_CR43","unstructured":"Gabrilovich E, Markovitch S (2007) Computing semantic relatedness using Wikipedia-based explicit semantic analysis. In: Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI\u201907. Morgan Kaufmann Publishers Inc., San Francisco, pp 1606\u20131611"},{"key":"875_CR44","doi-asserted-by":"crossref","unstructured":"Garimella K, De\u00a0Francisci\u00a0Morales G, Gionis A, Mathioudakis M (2017a) Reducing controversy by connecting opposing views. In: Proceedings of the tenth ACM International Conference on Web Search and Data Mining, WSDM \u201917","DOI":"10.1145\/3018661.3018703"},{"key":"875_CR45","unstructured":"Garimella K, Gionis A, Parotsidis N, Tatti N (2017b) Balancing information exposure in social networks. In: Advances in neural information processing systems, pp 4663\u20134671"},{"key":"875_CR46","doi-asserted-by":"crossref","unstructured":"Garimella K, De\u00a0Francisci\u00a0Morales G, Gionis A, Mathioudakis M (2018a) Political discourse on social media: echo chambers, gatekeepers, and the price of bipartisanship. In: Proceedings of the 2018 World Wide Web Conference, pp 913\u2013922","DOI":"10.1145\/3178876.3186139"},{"key":"875_CR47","doi-asserted-by":"crossref","unstructured":"Garimella K, Morales GDF, Gionis A, Mathioudakis M (2018b) Quantifying controversy on social media. ACM Trans Soc Comput","DOI":"10.1145\/3140565"},{"key":"875_CR48","doi-asserted-by":"crossref","unstructured":"Ge M, Delgado-Battenfeld C, Jannach D (2010) Beyond accuracy: Evaluating recommender systems by coverage and serendipity. In: Proceedings of the fourth ACM Conference on Recommender Systems, RecSys \u201910, pp 257\u2013260","DOI":"10.1145\/1864708.1864761"},{"key":"875_CR49","doi-asserted-by":"publisher","unstructured":"Ge Y, Zhao S, Zhou H, Pei C, Sun F, Ou W, Zhang Y (2020) Understanding echo chambers in e-commerce recommender systems. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. Association for Computing Machinery, New York, pp 2261\u20132270. https:\/\/doi.org\/10.1145\/3397271.3401431","DOI":"10.1145\/3397271.3401431"},{"key":"875_CR50","doi-asserted-by":"publisher","unstructured":"Geyik SC, Ambler S, Kenthapadi K (2019) Fairness-aware ranking in search & recommendation systems with application to LinkedIn talent search. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM. https:\/\/doi.org\/10.1145\/3292500.3330691","DOI":"10.1145\/3292500.3330691"},{"key":"875_CR51","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"875_CR52","doi-asserted-by":"publisher","unstructured":"Haddadan S, Menghini C, Riondato M, Upfal E (2021) RePBubLik: reducing polarized bubble radius with link insertions. In: Lewin-Eytan L, Carmel D, Yom-Tov E, Agichtein E, Gabrilovich E (eds) WSDM \u201921, The Fourteenth ACM International Conference on Web Search and Data Mining, Virtual Event, Israel, March 8\u201312, 2021. ACM, pp 139\u2013147. https:\/\/doi.org\/10.1145\/3437963.3441825","DOI":"10.1145\/3437963.3441825"},{"key":"875_CR53","doi-asserted-by":"publisher","DOI":"10.1145\/2827872","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: history and context. ACM Trans Interact Intell Syst. https:\/\/doi.org\/10.1145\/2827872","journal-title":"ACM Trans Interact Intell Syst"},{"issue":"2","key":"875_CR54","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1080\/1369118X.2016.1271900","volume":"21","author":"N Helberger","year":"2018","unstructured":"Helberger N, Karppinen K, D\u2019Acunto L (2018) Exposure diversity as a design principle for recommender systems. Inf Commun Soc 21(2):191\u2013207. https:\/\/doi.org\/10.1080\/1369118X.2016.1271900","journal-title":"Inf Commun Soc"},{"key":"875_CR55","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1007\/978-3-319-06028-6_67","volume-title":"Advances in information retrieval","author":"K Hofmann","year":"2014","unstructured":"Hofmann K, Schuth A, Bellog\u00edn A, de Rijke M (2014) Effects of position bias on click-based recommender evaluation. In: de Rijke M, Kenter T, de Vries AP, Zhai C, de Jong F, Radinsky K, Hofmann K (eds) Advances in information retrieval. Springer, Cham, pp 624\u2013630"},{"key":"875_CR56","doi-asserted-by":"publisher","unstructured":"Hu Y, Koren Y, Volinsky C (2008) Collaborative filtering for implicit feedback datasets. In: Proceedings of the 2008 eighth IEEE International Conference on Data Mining, ICDM \u201908. IEEE Computer Society, USA, pp 263\u2013272. https:\/\/doi.org\/10.1109\/ICDM.2008.22","DOI":"10.1109\/ICDM.2008.22"},{"key":"875_CR57","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.socnet.2018.08.008","volume":"60","author":"JL Hua","year":"2020","unstructured":"Hua JL, Yu J, Yang M (2020) Fast clustering for signed graphs based on random walk gap. Soc Netw 60:113\u2013128","journal-title":"Soc Netw"},{"issue":"6","key":"875_CR58","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1037\/0022-3514.50.6.1141","volume":"50","author":"DJ Isenberg","year":"1986","unstructured":"Isenberg DJ (1986) Group polarization: a critical review and meta-analysis. J Pers Soc Psychol 50(6):1141","journal-title":"J Pers Soc Psychol"},{"key":"875_CR59","doi-asserted-by":"crossref","unstructured":"Jiang R, Chiappa S, Lattimore T, Gy\u00f6rgy A, Kohli P (2019) Degenerate feedback loops in recommender systems. In: Proceedings of the 2019 AAAI\/ACM Conference on AI, Ethics, and Society, pp 383\u2013390","DOI":"10.1145\/3306618.3314288"},{"key":"875_CR60","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10115-019-01364-z","volume":"62","author":"J Jung","year":"2019","unstructured":"Jung J, Jin W, Kang U (2019) Random walk-based ranking in signed social networks: model and algorithms. Knowl Inf Syst 62:571\u2013610","journal-title":"Knowl Inf Syst"},{"key":"875_CR61","doi-asserted-by":"crossref","unstructured":"Khajehnejad A, Khajehnejad M, Babaei M, Gummadi KP, Weller A, Mirzasoleiman B (2022) Crosswalk: fairness-enhanced node representation learning. In: AAAI","DOI":"10.1609\/aaai.v36i11.21454"},{"key":"875_CR62","doi-asserted-by":"crossref","unstructured":"Kotkov D, Veijalainen J, Wang S (2016) Challenges of serendipity in recommender systems. In: WEBIST 2016: proceedings of the 12th international conference on web information systems and technologies","DOI":"10.5220\/0005879802510256"},{"key":"875_CR63","doi-asserted-by":"crossref","unstructured":"Kumar S, Hamilton WL, Leskovec J, Jurafsky D (2018) Community interaction and conflict on the web. In: Proceedings of the 2018 World Wide Web Conference, pp 933\u2013943","DOI":"10.1145\/3178876.3186141"},{"issue":"C","key":"875_CR64","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.knosys.2017.02.009","volume":"123","author":"M Kunaver","year":"2017","unstructured":"Kunaver M, Porl T (2017) Diversity in recommender systems a survey. Know-Based Syst 123(C):154\u2013162. https:\/\/doi.org\/10.1016\/j.knosys.2017.02.009","journal-title":"Know-Based Syst"},{"key":"875_CR65","doi-asserted-by":"publisher","unstructured":"Lamprecht D, Dimitrov D, Helic D, Strohmaier M (2016) Evaluating and improving navigability of Wikipedia: a comparative study of eight language editions. In: Proceedings of the 12th International Symposium on Open Collaboration, OpenSym \u201916. ACM, New York, pp 17:1\u201317:10. https:\/\/doi.org\/10.1145\/2957792.2957813","DOI":"10.1145\/2957792.2957813"},{"key":"875_CR66","unstructured":"LeFebvre R (2017) Obama Foundation taps social media to fight online echo chambers. https:\/\/www.engadget.com\/2017-07-05-obama-foundation-social-media-echo-chambers.html"},{"key":"875_CR67","doi-asserted-by":"publisher","unstructured":"Lerman K, Hogg T (2014) Leveraging position bias to improve peer recommendation. PLoS ONE. https:\/\/doi.org\/10.1371\/journal.pone.0098914","DOI":"10.1371\/journal.pone.0098914"},{"issue":"1","key":"875_CR68","doi-asserted-by":"publisher","first-page":"5-es","DOI":"10.1145\/1232722.1232727","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Adamic LA, Huberman BA (2007) The dynamics of viral marketing. ACM Trans Web TWEB 1(1):5-es","journal-title":"ACM Trans Web TWEB"},{"key":"875_CR69","doi-asserted-by":"crossref","unstructured":"Liao QV, Fu WT (2014a) Can you hear me now? Mitigating the echo chamber effect by source position indicators. In: Proceedings of the 17th ACM conference on Computer supported cooperative work & social computing, pp 184\u2013196","DOI":"10.1145\/2531602.2531711"},{"key":"875_CR70","doi-asserted-by":"crossref","unstructured":"Liao QV, Fu WT (2014b) Expert voices in echo chambers: effects of source expertise indicators on exposure to diverse opinions. In: Proceedings of the SIGCHI conference on human factors in computing systems, pp 2745\u20132754","DOI":"10.1145\/2556288.2557240"},{"key":"875_CR71","doi-asserted-by":"crossref","unstructured":"Mahmoody A, Tsourakakis CE, Upfal E (2016) Scalable betweenness centrality maximization via sampling. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining","DOI":"10.1145\/2939672.2939869"},{"key":"875_CR72","doi-asserted-by":"publisher","first-page":"1480","DOI":"10.1007\/s10618-017-0527-9","volume":"31","author":"A Matakos","year":"2017","unstructured":"Matakos A, Terzi E, Tsaparas P (2017) Measuring and moderating opinion polarization in social networks. Data Min Knowl Discov 31:1480\u20131505","journal-title":"Data Min Knowl Discov"},{"key":"875_CR73","doi-asserted-by":"publisher","first-page":"3697","DOI":"10.1007\/s10115-020-01456-1","volume":"9","author":"A Matakos","year":"2020","unstructured":"Matakos A, Tu S, Gionis A (2020) Tell me something my friends do not know: diversity maximization in social networks. Knowl Inf Syst 9:3697\u20133726","journal-title":"Knowl Inf Syst"},{"key":"875_CR74","doi-asserted-by":"crossref","unstructured":"Medya S, Silva A, Singh A, Basu P, Swami A (2018) Group centrality maximization via network design. In: Proceedings of the 2018 SIAM international conference on data mining. SIAM, pp 126\u2013134","DOI":"10.1137\/1.9781611975321.14"},{"key":"875_CR75","doi-asserted-by":"crossref","unstructured":"Menghini C, Anagnostopoulos A, Upfal E (2019) Wikipedia polarization and its effects on navigation paths. In: 2019 IEEE International Conference on Big Data (Big Data), pp 6154\u20136156","DOI":"10.1109\/BigData47090.2019.9005566"},{"key":"875_CR76","unstructured":"Menghini C, Anagnostopoulos A, Upfal E (2020) Wikipedia\u2019s network bias on controversial topics. arXiv:2007.08197"},{"issue":"1","key":"875_CR77","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0012-365X(98)00076-4","volume":"192","author":"B Monjardet","year":"1998","unstructured":"Monjardet B (1998) On the comparison of the Spearman and Kendall metrics between linear orders. Discrete Math 192(1):281\u2013292. https:\/\/doi.org\/10.1016\/S0012-365X(98)00076-4","journal-title":"Discrete Math"},{"issue":"3","key":"875_CR78","doi-asserted-by":"publisher","first-page":"033114","DOI":"10.1063\/1.4913758","volume":"25","author":"AJ Morales","year":"2015","unstructured":"Morales AJ, Borondo J, Losada JC, Benito RM (2015) Measuring political polarization: Twitter shows the two sides of Venezuela. Chaos Interdiscip J Nonlinear Sci 25(3):033114","journal-title":"Chaos Interdiscip J Nonlinear Sci"},{"key":"875_CR79","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1214\/14-PS230","volume":"14","author":"E Mossel","year":"2017","unstructured":"Mossel E, Tamuz O (2017) Opinion exchange dynamics. Probab Surv 14:155\u2013204","journal-title":"Probab Surv"},{"key":"875_CR80","unstructured":"Munson SA, Lee SY, Resnick P (2013) Encouraging reading of diverse political viewpoints with a browser widget. In: Seventh international AAAI conference on weblogs and social media"},{"key":"875_CR81","doi-asserted-by":"crossref","unstructured":"Musco C, Musco C, Tsourakakis CE (2018) Minimizing polarization and disagreement in social networks. In: Proceedings of the 2018 World Wide Web Conference on World Wide Web\u2014WWW \u201918","DOI":"10.1145\/3178876.3186103"},{"key":"875_CR82","doi-asserted-by":"crossref","unstructured":"Nelimarkka M, Laaksonen SM, Semaan B (2018) Social media is polarized, social media is polarized: towards a new design agenda for mitigating polarization. In: Proceedings of the 2018 designing interactive systems conference, pp 957\u2013970","DOI":"10.1145\/3196709.3196764"},{"key":"875_CR83","doi-asserted-by":"publisher","unstructured":"Nguyen TT, Hui PM, Harper FM, Terveen L, Konstan JA (2014) Exploring the filter bubble: the effect of using recommender systems on content diversity. In: Proceedings of the 23rd international conference on World Wide Web, WWW \u201914. Association for Computing Machinery, New York, pp 677\u2013686. https:\/\/doi.org\/10.1145\/2566486.2568012","DOI":"10.1145\/2566486.2568012"},{"issue":"4","key":"875_CR84","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1177\/0894439314555329","volume":"33","author":"D O\u2019Callaghan","year":"2015","unstructured":"O\u2019Callaghan D, Greene D, Conway M, Carthy J, Cunningham P (2015) Down the (white) rabbit hole: the extreme right and online recommender systems. Soc Sci Comput Rev 33(4):459\u2013478. https:\/\/doi.org\/10.1177\/0894439314555329","journal-title":"Soc Sci Comput Rev"},{"key":"875_CR85","doi-asserted-by":"crossref","unstructured":"Papagelis M, Bonchi F, Gionis A (2011) Suggesting ghost edges for a smaller world. In: Proceedings of the 20th ACM international conference on Information and knowledge management, pp 2305\u20132308","DOI":"10.1145\/2063576.2063952"},{"key":"875_CR86","volume-title":"The filter bubble: what the Internet is hiding from you","author":"E Pariser","year":"2011","unstructured":"Pariser E (2011) The filter bubble: what the Internet is hiding from you. Penguin"},{"key":"875_CR87","doi-asserted-by":"crossref","unstructured":"Parotsidis N, Pitoura E, Tsaparas P (2015) Selecting shortcuts for a smaller world. In: Proceedings of the 2015 SIAM international conference on data mining. SIAM, pp 28\u201336","DOI":"10.1137\/1.9781611974010.4"},{"key":"875_CR88","doi-asserted-by":"crossref","unstructured":"Parotsidis N, Pitoura E, Tsaparas P (2016) Centrality-aware link recommendations. In: Proceedings of the ninth ACM international conference on web search and data mining, pp 503\u2013512","DOI":"10.1145\/2835776.2835818"},{"key":"875_CR89","doi-asserted-by":"crossref","unstructured":"Perumal S, Basu P, Guan Z (2013) Minimizing eccentricity in composite networks via constrained edge additions. In: MILCOM 2013-2013 IEEE Military Communications Conference, pp 1894\u20131899","DOI":"10.1109\/MILCOM.2013.319"},{"key":"875_CR90","doi-asserted-by":"crossref","unstructured":"Rahman TA, Surma B, Backes M, Zhang Y (2019) Fairwalk: towards fair graph embedding. In: IJCAI","DOI":"10.24963\/ijcai.2019\/456"},{"key":"875_CR91","doi-asserted-by":"crossref","unstructured":"Rastegarpanah B, Gummadi KP, Crovella M (2019) Fighting fire with fire: using antidote data to improve polarization and fairness of recommender systems. In: Proceedings of the twelfth ACM international conference on Web Search and Data Mining, WSDM \u201919","DOI":"10.1145\/3289600.3291002"},{"key":"875_CR92","doi-asserted-by":"publisher","unstructured":"Resnick P, Garrett RK, Kriplean T, Munson SA, Stroud NJ (2013) Bursting your (filter) bubble: strategies for promoting diverse exposure. In: Proceedings of the 2013 conference on computer supported cooperative work companion, CSCW \u201913. Association for Computing Machinery, New York, pp 95\u2013100. https:\/\/doi.org\/10.1145\/2441955.2441981","DOI":"10.1145\/2441955.2441981"},{"key":"875_CR93","doi-asserted-by":"crossref","unstructured":"Ribeiro MH, Ottoni R, West R, Almeida VAF, Meira W (2019) Auditing radicalization pathways on YouTube. arXiv:1908.08313","DOI":"10.1145\/3351095.3372879"},{"key":"875_CR94","doi-asserted-by":"crossref","unstructured":"Ribeiro MH, Ottoni R, West R, Almeida VAF, Meira W (2020) Auditing radicalization pathways on Youtube. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency, FAT* \u201920, pp 131\u2013141","DOI":"10.1145\/3351095.3372879"},{"key":"875_CR95","doi-asserted-by":"crossref","unstructured":"Richardson M, Dominowska E, Ragno R (2007) Predicting clicks: estimating the click-through rate for new ads. In: Proceedings of the 16th international conference on World Wide Web, pp 521\u2013530","DOI":"10.1145\/1242572.1242643"},{"key":"875_CR96","doi-asserted-by":"publisher","unstructured":"Singh A, Joachims T (2018) Fairness of exposure in rankings. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. Association for Computing Machinery, New York, pp 2219\u20132228. https:\/\/doi.org\/10.1145\/3219819.3220088","DOI":"10.1145\/3219819.3220088"},{"key":"875_CR97","unstructured":"Singh A, Joachims T (2019) Policy learning for fairness in ranking. In: Wallach H, Larochelle H, Beygelzimer A, d\u2019 Alch\u00e9-Buc F, Fox E, Garnett R (eds) Advances in neural information processing systems, vol 32. Curran Associates, Inc., pp 5426\u20135436. https:\/\/proceedings.neurips.cc\/paper\/2019\/file\/9e82757e9a1c12cb710ad680db11f6f1-Paper.pdf"},{"issue":"3","key":"875_CR98","doi-asserted-by":"publisher","first-page":"e0213246","DOI":"10.1371\/journal.pone.0213246","volume":"14","author":"A S\u00eerbu","year":"2019","unstructured":"S\u00eerbu A, Pedreschi D, Giannotti F, Kert\u00e9sz J (2019) Algorithmic bias amplifies opinion fragmentation and polarization: a bounded confidence model. PLoS ONE 14(3):e0213246","journal-title":"PLoS ONE"},{"key":"875_CR99","doi-asserted-by":"crossref","unstructured":"Stoica AA, Chaintreau A (2019) Hegemony in social media and the effect of recommendations. In: Companion proceedings of the 2019 World Wide Web Conference","DOI":"10.1145\/3308560.3317589"},{"key":"875_CR100","doi-asserted-by":"crossref","unstructured":"Stoica AA, Riederer C, Chaintreau A (2018) Algorithmic glass ceiling in social networks. In: Proceedings of the 2018 World Wide Web Conference. ACM Press","DOI":"10.1145\/3178876.3186140"},{"key":"875_CR101","doi-asserted-by":"crossref","unstructured":"Stoica AA, Han JX, Chaintreau A (2020) Seeding network influence in biased networks and the benefits of diversity. In: Proceedings of the web conference 2020. ACM","DOI":"10.1145\/3366423.3380275"},{"issue":"2","key":"875_CR102","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1111\/1467-9760.00148","volume":"10","author":"CR Sunstein","year":"2002","unstructured":"Sunstein CR (2002) The law of group polarization. J Polit Philos 10(2):175\u2013195","journal-title":"J Polit Philos"},{"key":"875_CR103","unstructured":"Tabibian B, G\u00f3mez V, De A, Sch\u00f6lkopf B, Gomez\u00a0Rodriguez M (2020) On the design of consequential ranking algorithms. In: Peters J, Sontag D (eds) Proceedings of the 36th conference on Uncertainty in Artificial Intelligence (UAI), PMLR, Proceedings of Machine Learning Research, vol 124, pp 171\u2013180. http:\/\/proceedings.mlr.press\/v124\/tabibian20a.html"},{"key":"875_CR104","doi-asserted-by":"publisher","unstructured":"Taramigkou M, Bothos E, Christidis K, Apostolou D, Mentzas G (2013) Escape the bubble: guided exploration of music preferences for serendipity and novelty. In: Proceedings of the 7th ACM Conference on Recommender Systems, RecSys \u201913. Association for Computing Machinery, New York, pp 335\u2013338. https:\/\/doi.org\/10.1145\/2507157.2507223","DOI":"10.1145\/2507157.2507223"},{"key":"875_CR105","doi-asserted-by":"crossref","unstructured":"Tong H, Prakash BA, Eliassi-Rad T, Faloutsos M, Faloutsos C (2012) Gelling, and melting, large graphs by edge manipulation. In: Proceedings of the 21st ACM international conference on Information and knowledge management, pp 245\u2013254","DOI":"10.1145\/2396761.2396795"},{"key":"875_CR106","doi-asserted-by":"crossref","unstructured":"Vargas S, Baltrunas L, Karatzoglou A, Castells P (2014) Coverage, redundancy and size-awareness in genre diversity for recommender systems. In: Proceedings of the 8th ACM conference on recommender systems, pp 209\u2013216","DOI":"10.1145\/2645710.2645743"},{"key":"875_CR107","unstructured":"W\u0105s T, Waniek M, Rahwan T, Michalak T (2020) The manipulability of centrality measures\u2014an axiomatic approach. In: Proceedings of the 19th international conference on autonomous agents and multiagent systems, pp 1467\u20131475"},{"key":"875_CR108","doi-asserted-by":"crossref","unstructured":"White S, Smyth P (2003) Algorithms for estimating relative importance in networks. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge Discovery and Data Mining, KDD \u201903, pp 266\u2013275","DOI":"10.1145\/956750.956782"},{"key":"875_CR109","unstructured":"Yao S, Huang B (2017) Beyond parity: fairness objectives for collaborative filtering. arXiv preprint arXiv:1705.08804"},{"key":"875_CR110","doi-asserted-by":"crossref","unstructured":"Zehlike M, Bonchi F, Castillo C, Hajian S, Megahed M, Baeza-Yates R (2017) Fa* ir: a fair top-k ranking algorithm. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 1569\u20131578","DOI":"10.1145\/3132847.3132938"},{"issue":"8","key":"875_CR111","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/14\/8\/083006","volume":"14","author":"A Zeng","year":"2012","unstructured":"Zeng A, L\u00fc L, Zhou T (2012) Manipulating directed networks for better synchronization. New J Phys 14(8):083006","journal-title":"New J Phys"},{"issue":"4","key":"875_CR112","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1017\/S1351324912000125","volume":"19","author":"Z Zhang","year":"2013","unstructured":"Zhang Z, Gentile AL, Ciravegna F (2013) Recent advances in methods of lexical semantic relatedness\u2014a survey. Nat Lang Eng 19(4):411\u2013479. https:\/\/doi.org\/10.1017\/S1351324912000125","journal-title":"Nat Lang Eng"},{"key":"875_CR113","doi-asserted-by":"publisher","unstructured":"Zhu Z, Hu X, Caverlee J (2018) Fairness-aware tensor-based recommendation. In: Proceedings of the 27th ACM international conference on information and knowledge management. ACM. https:\/\/doi.org\/10.1145\/3269206.3271795","DOI":"10.1145\/3269206.3271795"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00875-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-022-00875-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-022-00875-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T02:53:33Z","timestamp":1728096813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-022-00875-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,2]]},"references-count":113,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["875"],"URL":"https:\/\/doi.org\/10.1007\/s10618-022-00875-8","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2022,10,2]]},"assertion":[{"value":"31 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2022","order":3,"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 they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}