Bibek Paudel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bibek Paudel has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Abraham Bernstein
University of Zurich, Zurich, Switzerland
2 shared publications - Alena Birrer
University of Zurich, Switzerland
1 shared publication - Juliane A. Lischka
Universität Hamburg
1 shared publication - Laura Laugwitz
Department of Social Sciences, University of Hamburg
1 shared publication - Lucien Heitz
Department of Informatics, University of Zürich, Zürich, Switzerland
1 shared publication - Suzanne Tolmeijer
Information Systems, Socio-Technical Systems Design (WISTS), University of Hamburg, Hamburg, Germany
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 8 February 2022
- Published by Taylor & Francis in Digital Journalism
- Vol. 10 (10) , 1710-1730
Benefits of Diverse News Recommendations for Democracy: A User Study
News recommender systems provide a technological architecture that helps shaping public discourse. Following a normative approach to news recommender system design, we test utility and external effects of a diversity-aware news recommender algorithm. In an experimental study using a custom-built news app, we show that diversity-optimized recommendations (1) perform similar to methods optimizing for user preferences regarding user utility, (2) that diverse news recommendations are related to a higher tolerance for opposing views, especially for politically conservative users, and (3) that diverse news recommender systems may nudge users towards preferring news with differing or even opposing views. We conclude that diverse news recommendations can have a depolarizing capacity for democratic societies.
- 8 February 2022
- Published by Taylor & Francis in Digital Journalism
- Vol. 10 (10) , 1710-1730
Top Cited PapersOpen AccessBenefits of Diverse News Recommendations for Democracy: A User Study
News recommender systems provide a technological architecture that helps shaping public discourse. Following a normative approach to news recommender system design, we test utility and external effects of a diversity-aware news recommender algorithm. In an experimental study using a custom-built news app, we show that diversity-optimized recommendations (1) perform similar to methods optimizing for user preferences regarding user utility, (2) that diverse news recommendations are related to a higher tolerance for opposing views, especially for politically conservative users, and (3) that diverse news recommender systems may nudge users towards preferring news with differing or even opposing views. We conclude that diverse news recommendations can have a depolarizing capacity for democratic societies.
- Open Access
- 19 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 2046-2057
Random Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks
Most existing personalization systems promote items that match a user’s previous choices or those that are popular among similar users. This results in recommendations that are highly similar to the ones users are already exposed to, resulting in their isolation inside familiar but insulated information silos. In this context, we develop a novel recommendation framework with a goal of improving information diversity using a modified random walk exploration of the user-item graph. We focus on the problem of political content recommendation, while addressing a general problem applicable to personalization tasks in other social and information networks. For recommending political content on social networks, we first propose a new model to estimate the ideological positions for both users and the content they share, which is able to recover ideological positions with high accuracy. Based on these estimated positions, we generate diversified personalized recommendations using our new random-walk based recommendation algorithm. With experimental evaluations on large datasets of Twitter discussions, we show that our method based on random walks with erasure is able to generate more ideologically diverse recommendations. Our approach does not depend on the availability of labels regarding the bias of users or content producers. With experiments on open benchmark datasets from other social and information networks, we also demonstrate the effectiveness of our method in recommending diverse long-tail items.
- 19 April 2021
- Published by Association for Computing Machinery (ACM)
- p. 2046-2057
Open AccessRandom Walks with Erasure: Diversifying Personalized Recommendations on Social and Information Networks
Most existing personalization systems promote items that match a user’s previous choices or those that are popular among similar users. This results in recommendations that are highly similar to the ones users are already exposed to, resulting in their isolation inside familiar but insulated information silos. In this context, we develop a novel recommendation framework with a goal of improving information diversity using a modified random walk exploration of the user-item graph. We focus on the problem of political content recommendation, while addressing a general problem applicable to personalization tasks in other social and information networks. For recommending political content on social networks, we first propose a new model to estimate the ideological positions for both users and the content they share, which is able to recover ideological positions with high accuracy. Based on these estimated positions, we generate diversified personalized recommendations using our new random-walk based recommendation algorithm. With experimental evaluations on large datasets of Twitter discussions, we show that our method based on random walks with erasure is able to generate more ideologically diverse recommendations. Our approach does not depend on the availability of labels regarding the bias of users or content producers. With experiments on open benchmark datasets from other social and information networks, we also demonstrate the effectiveness of our method in recommending diverse long-tail items.