Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3485447.3512143acmconferencesArticle/Chapter ViewAbstractPublication PageswebconfConference Proceedingsconference-collections
research-article

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways

Published: 25 April 2022 Publication History
  • Get Citation Alerts
  • Abstract

    Recommender systems typically suggest to users content similar to what they consumed in the past. If a user happens to be exposed to strongly polarized content, she might subsequently receive recommendations which may steer her towards more and more radicalized content, eventually being trapped in what we call a “radicalization pathway”. In this paper, we study the problem of mitigating radicalization pathways using a graph-based approach. Specifically, we model the set of recommendations of a “what-to-watch-next” recommender as a d-regular directed graph where nodes correspond to content items, links to recommendations, and paths to possible user sessions.
    We measure the “segregation” score of a node representing radicalized content as the expected length of a random walk from that node to any node representing non-radicalized content. High segregation scores are associated to larger chances to get users trapped in radicalization pathways. Hence, we define the problem of reducing the prevalence of radicalization pathways by selecting a small number of edges to “rewire”, so to minimize the maximum of segregation scores among all radicalized nodes, while maintaining the relevance of the recommendations.
    We prove that the problem of finding the optimal set of recommendations to rewire is NP-hard and NP-hard to approximate within any factor. Therefore, we turn our attention to heuristics, and propose an efficient yet effective greedy algorithm based on the absorbing random walk theory. Our experiments on real-world datasets in the context of video and news recommendations confirm the effectiveness of our proposal.

    References

    [1]
    Hunt Allcott and Matthew Gentzkow. 2017. Social Media and Fake News in the 2016 Election. J. Econ. Perspect. 31, 2 (2017), 211–236.
    [2]
    Victor Amelkin and Ambuj K. Singh. 2019. Fighting Opinion Control in Social Networks via Link Recommendation. In KDD. 677–685.
    [3]
    Elisabetta Bergamini, Pierluigi Crescenzi, Gianlorenzo D’Angelo, Henning Meyerhenke, Lorenzo Severini, and Yllka Velaj. 2018. Improving the Betweenness Centrality of a Node by Adding Links. ACM J. Exp. Algorithmics 23 (2018).
    [4]
    Asia J. Biega, Krishna P. Gummadi, and Gerhard Weikum. 2018. Equity of Attention: Amortizing Individual Fairness in Rankings. In SIGIR. 405–414.
    [5]
    Matteo Castiglioni, Diodato Ferraioli, and Nicola Gatti. 2020. Election Control in Social Networks via Edge Addition or Removal. In AAAI. 1878–1885.
    [6]
    Hau Chan, Leman Akoglu, and Hanghang Tong. 2014. Make It or Break It: Manipulating Robustness in Large Networks. In SDM. 325–333.
    [7]
    Xi Chen, Jefrey Lijffijt, and Tijl De Bie. 2018. Quantifying and Minimizing Risk of Conflict in Social Networks. In KDD. 1197–1205.
    [8]
    Uthsav Chitra and Christopher Musco. 2020. Analyzing the Impact of Filter Bubbles on Social Network Polarization. In WSDM. 115–123.
    [9]
    Federico Cinus, Marco Minici, Corrado Monti, and Francesco Bonchi. 2021. The Effect of People Recommenders on Echo Chambers and Polarization. (2021). arxiv:2112.00626 [cs.SI]
    [10]
    Pierluigi Crescenzi, Gianlorenzo D’Angelo, Lorenzo Severini, and Yllka Velaj. 2016. Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data 11, 1 (2016), 9:1–9:32.
    [11]
    Mihaela Curmei, Sarah Dean, and Benjamin Recht. 2021. Quantifying Availability and Discovery in Recommender Systems via Stochastic Reachability. In ICML. 2265–2275.
    [12]
    Gianlorenzo D’Angelo, Martin Olsen, and Lorenzo Severini. 2019. Coverage Centrality Maximization in Undirected Networks. In AAAI. 501–508.
    [13]
    Sarah Dean, Sarah Rich, and Benjamin Recht. 2020. Recommendations and user agency: the reachability of collaboratively-filtered information. In FAT*. 436–445.
    [14]
    Francesco Fabbri, Francesco Bonchi, Ludovico Boratto, and Carlos Castillo. 2020. The Effect of Homophily on Disparate Visibility of Minorities in People Recommender Systems. In ICWSM. 165–175.
    [15]
    Francesco Fabbri, Maria Luisa Croci, Francesco Bonchi, and Carlos Castillo. 2021. Exposure Inequality in People Recommender Systems: The Long-Term Effects. arxiv:2112.08237 [cs.SI]
    [16]
    Emilio Ferrara, Onur Varol, Clayton A. Davis, Filippo Menczer, and Alessandro Flammini. 2016. The rise of social bots. Commun. ACM 59, 7 (2016), 96–104.
    [17]
    M. R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.
    [18]
    Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, and Michael Mathioudakis. 2016. Quantifying Controversy in Social Media. In WSDM. 33–42.
    [19]
    Kiran Garimella, Gianmarco De Francisci Morales, Aristides Gionis, and Michael Mathioudakis. 2017. Reducing Controversy by Connecting Opposing Views. In WSDM. 81–90.
    [20]
    Pedro Henrique Calais Guerra, Wagner Meira Jr., Claire Cardie, and Robert Kleinberg. 2013. A Measure of Polarization on Social Media Networks Based on Community Boundaries. In ICWSM. 215–224.
    [21]
    Shahrzad Haddadan, Cristina Menghini, Matteo Riondato, and Eli Upfal. 2021. RePBubLik: Reducing Polarized Bubble Radius with Link Insertions. In WSDM. 139–147.
    [22]
    Yifan Hu, Yehuda Koren, and Chris Volinsky. 2008. Collaborative filtering for implicit feedback datasets. In ICDM. 263–272.
    [23]
    Ruben Interian, Jorge R. Moreno, and Celso C. Ribeiro. 2021. Polarization reduction by minimum-cardinality edge additions: Complexity and integer programming approaches. Int. Trans. Oper. Res. 28, 3 (2021), 1242–1264.
    [24]
    Kalervo Järvelin and Jaana Kekäläinen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20, 4 (2002), 422–446.
    [25]
    Elias Boutros Khalil, Bistra Dilkina, and Le Song. 2014. Scalable diffusion-aware optimization of network topology. In KDD. 1226–1235.
    [26]
    Masahiro Kimura, Kazumi Saito, and Hiroshi Motoda. 2008. Minimizing the Spread of Contamination by Blocking Links in a Network. In AAAI. 1175–1180.
    [27]
    Chris J. Kuhlman, Gaurav Tuli, Samarth Swarup, Madhav V. Marathe, and S. S. Ravi. 2013. Blocking Simple and Complex Contagion by Edge Removal. In ICDM. 399–408.
    [28]
    Long T. Le, Tina Eliassi-Rad, and Hanghang Tong. 2015. MET: A Fast Algorithm for Minimizing Propagation in Large Graphs with Small Eigen-Gaps. In SDM. 694–702.
    [29]
    Mark Ledwich and Anna Zaitsev. 2020. Algorithmic extremism: Examining YouTube’s rabbit hole of radicalization. First Monday 25, 3 (2020).
    [30]
    Rebecca Lewis. 2018. Alternative Influence: Broadcasting the Reactionary Right on YouTube. Technical Report. Data & Society Research Institute.
    [31]
    Rong-Hua Li and Jeffrey Xu Yu. 2015. Triangle minimization in large networks. Knowl. Inf. Syst. 45, 3 (2015), 617–643.
    [32]
    Yinhan Liu, Myle Ott, Naman Goyal, Jingfei Du, Mandar Joshi, Danqi Chen, Omer Levy, Mike Lewis, Luke Zettlemoyer, and Veselin Stoyanov. 2019. RoBERTa: A Robustly Optimized BERT Pretraining Approach. arxiv:1907.11692 [cs.CL]
    [33]
    Shervin Malmasi and Marcos Zampieri. 2017. Detecting Hate Speech in Social Media. In RANLP. 467–472.
    [34]
    Charalampos Mavroforakis, Michael Mathioudakis, and Aristides Gionis. 2015. Absorbing Random-Walk Centrality: Theory and Algorithms. In ICDM. 901–906.
    [35]
    Clark McCauley and Sophia Moskalenko. 2008. Mechanisms of Political Radicalization: Pathways Toward Terrorism. Terror. Political Violence 20, 3 (2008), 415–433.
    [36]
    Sourav Medya, Arlei Silva, Ambuj K. Singh, Prithwish Basu, and Ananthram Swami. 2018. Group Centrality Maximization via Network Design. In SDM. 126–134.
    [37]
    Mainack Mondal, Leandro Araújo Silva, and Fabrício Benevenuto. 2017. A Measurement Study of Hate Speech in Social Media. In HT. 85–94.
    [38]
    Cameron Musco, Christopher Musco, and Charalampos E. Tsourakakis. 2018. Minimizing Polarization and Disagreement in Social Networks. In WWW. 369–378.
    [39]
    Jeppe Nørregaard, Benjamin D. Horne, and Sibel Adali. 2019. NELA-GT-2018: A Large Multi-Labelled News Dataset for the Study of Misinformation in News Articles. In ICWSM. 630–638.
    [40]
    Kostantinos Papadamou, Antonis Papasavva, Savvas Zannettou, Jeremy Blackburn, Nicolas Kourtellis, Ilias Leontiadis, Gianluca Stringhini, and Michael Sirivianos. 2020. Disturbed YouTube for Kids: Characterizing and Detecting Inappropriate Videos Targeting Young Children. In ICWSM. 522–533.
    [41]
    Manos Papagelis. 2015. Refining Social Graph Connectivity via Shortcut Edge Addition. ACM Trans. Knowl. Discov. Data 10, 2 (2015), 12:1–12:35.
    [42]
    Manos Papagelis, Francesco Bonchi, and Aristides Gionis. 2011. Suggesting ghost edges for a smaller world. In CIKM. 2305–2308.
    [43]
    Nikos Parotsidis, Evaggelia Pitoura, and Panayiotis Tsaparas. 2015. Selecting Shortcuts for a Smaller World. In SDM. 28–36.
    [44]
    Nikos Parotsidis, Evaggelia Pitoura, and Panayiotis Tsaparas. 2016. Centrality-Aware Link Recommendations. In WSDM. 503–512.
    [45]
    Evaggelia Pitoura, Georgia Koutrika, and Kostas Stefanidis. 2020. Fairness in Rankings and Recommenders. In EDBT. 651–654.
    [46]
    William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. 2007. Numerical recipes 3rd edition: The art of scientific computing. Cambridge University Press.
    [47]
    Manoel Horta Ribeiro, Raphael Ottoni, Robert West, Virgílio A. F. Almeida, and Wagner Meira Jr.2020. Auditing radicalization pathways on YouTube. In FAT*. 131–141.
    [48]
    Kevin Roose. 2019. The Making of a YouTube Radical. The New York Times (2019). https://www.nytimes.com/interactive/2019/06/08/technology/youtube-radical.html
    [49]
    Sudip Saha, Abhijin Adiga, B. Aditya Prakash, and Anil Kumar S. Vullikanti. 2015. Approximation Algorithms for Reducing the Spectral Radius to Control Epidemic Spread. In SDM. 568–576.
    [50]
    Kai Shu, Amy Sliva, Suhang Wang, Jiliang Tang, and Huan Liu. 2017. Fake News Detection on Social Media: A Data Mining Perspective. SIGKDD Explor. 19, 1 (2017), 22–36.
    [51]
    Hanghang Tong, B. Aditya Prakash, Tina Eliassi-Rad, Michalis Faloutsos, and Christos Faloutsos. 2012. Gelling, and melting, large graphs by edge manipulation. In CIKM. 245–254.
    [52]
    Tomasz Was, Marcin Waniek, Talal Rahwan, and Tomasz P. Michalak. 2020. The Manipulability of Centrality Measures - An Axiomatic Approach. In AAMAS. 1467–1475.
    [53]
    Bari Weiss and Damon Winter. 2018. Meet the Renegades of the Intellectual Dark Web. The New York Times (2018). https://www.nytimes.com/2018/05/08/opinion/intellectual-dark-web.html
    [54]
    Ruidong Yan, Yi Li, Weili Wu, Deying Li, and Yongcai Wang. 2019. Rumor Blocking through Online Link Deletion on Social Networks. ACM Trans. Knowl. Discov. Data 13, 2 (2019), 16:1–16:26.
    [55]
    Zhe Zhao, Lichan Hong, Li Wei, Jilin Chen, Aniruddh Nath, Shawn Andrews, Aditee Kumthekar, Maheswaran Sathiamoorthy, Xinyang Yi, and Ed Chi. 2019. Recommending what video to watch next: a multitask ranking system. In RecSys. 43–51.
    [56]
    Weijie Zhu, Chen Chen, Xiaoyang Wang, and Xuemin Lin. 2018. K-core Minimization: An Edge Manipulation Approach. In CIKM. 1667–1670.

    Cited By

    View all
    • (2024)Exploring Reddit Community Structure: Bridges, Gateways and HighwaysElectronics10.3390/electronics1310193513:10(1935)Online publication date: 15-May-2024
    • (2024)Assessing the Impact of Music Recommendation Diversity on Listeners: A Longitudinal StudyACM Transactions on Recommender Systems10.1145/36084872:1(1-47)Online publication date: 7-Mar-2024
    • (2024)Local Centrality Minimization with Quality GuaranteesProceedings of the ACM on Web Conference 202410.1145/3589334.3645382(410-421)Online publication date: 13-May-2024
    • Show More Cited By

    Index Terms

    1. Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways
            Index terms have been assigned to the content through auto-classification.

            Recommendations

            Comments

            Information & Contributors

            Information

            Published In

            cover image ACM Conferences
            WWW '22: Proceedings of the ACM Web Conference 2022
            April 2022
            3764 pages
            ISBN:9781450390965
            DOI:10.1145/3485447
            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Sponsors

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            Published: 25 April 2022

            Permissions

            Request permissions for this article.

            Check for updates

            Author Tags

            1. extremist content
            2. filter bubbles
            3. polarization
            4. radicalization
            5. random walks
            6. recommender systems

            Qualifiers

            • Research-article
            • Research
            • Refereed limited

            Conference

            WWW '22
            Sponsor:
            WWW '22: The ACM Web Conference 2022
            April 25 - 29, 2022
            Virtual Event, Lyon, France

            Acceptance Rates

            Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

            Contributors

            Other Metrics

            Bibliometrics & Citations

            Bibliometrics

            Article Metrics

            • Downloads (Last 12 months)195
            • Downloads (Last 6 weeks)4
            Reflects downloads up to 27 Jul 2024

            Other Metrics

            Citations

            Cited By

            View all
            • (2024)Exploring Reddit Community Structure: Bridges, Gateways and HighwaysElectronics10.3390/electronics1310193513:10(1935)Online publication date: 15-May-2024
            • (2024)Assessing the Impact of Music Recommendation Diversity on Listeners: A Longitudinal StudyACM Transactions on Recommender Systems10.1145/36084872:1(1-47)Online publication date: 7-Mar-2024
            • (2024)Local Centrality Minimization with Quality GuaranteesProceedings of the ACM on Web Conference 202410.1145/3589334.3645382(410-421)Online publication date: 13-May-2024
            • (2023)Rewiring what-to-watch-next recommendations to reduce radicalization pathways (extended abstract)Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/715(6431-6435)Online publication date: 19-Aug-2023
            • (2023)Positive by DesignProceedings of the 34th ACM Conference on Hypertext and Social Media10.1145/3603163.3609068(1-4)Online publication date: 4-Sep-2023
            • (2023)The Interconnected Nature of Online Harm and ModerationProceedings of the 34th ACM Conference on Hypertext and Social Media10.1145/3603163.3609058(1-10)Online publication date: 4-Sep-2023
            • (2023)Rewiring Police Officer Training Networks to Reduce Forecasted Use of ForceProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599899(4696-4704)Online publication date: 6-Aug-2023
            • (2023)Reducing Exposure to Harmful Content via Graph RewiringProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599489(323-334)Online publication date: 6-Aug-2023
            • (2023)Minimizing Hitting Time between Disparate Groups with Shortcut EdgesProceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3580305.3599434(1-10)Online publication date: 6-Aug-2023
            • (2023)A Comprehensive Survey of Detection and Prevention Approaches for Online Radicalization: Identifying Gaps and Future DirectionsIEEE Access10.1109/ACCESS.2023.332699511(120463-120491)Online publication date: 2023
            • Show More Cited By

            View Options

            Get Access

            Login options

            View options

            PDF

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format.

            HTML Format

            Media

            Figures

            Other

            Tables

            Share

            Share

            Share this Publication link

            Share on social media