Rewiring what-to-watch-next recommendations to reduce radicalization pathways

F Fabbri, Y Wang, F Bonchi, C Castillo… - Proceedings of the …, 2022 - dl.acm.org
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 …

A survey on optimization studies of group centrality metrics

MC Camur, C Vogiatzis - Networks, 2024 - Wiley Online Library
Centrality metrics have become a popular concept in network science and optimization.
Over the years, centrality has been used to assign importance and identify influential …

Repbublik: Reducing polarized bubble radius with link insertions

S Haddadan, C Menghini, M Riondato… - Proceedings of the 14th …, 2021 - dl.acm.org
The topology of the hyperlink graph among pages expressing different opinions may
influence the exposure of readers to diverse content. Structural bias may trap a reader in …

Minimizing hitting time between disparate groups with shortcut edges

F Adriaens, H Wang, A Gionis - Proceedings of the 29th ACM SIGKDD …, 2023 - dl.acm.org
Structural bias or segregation of networks refers to situations where two or more disparate
groups are present in the network, so that the groups are highly connected internally, but …

Edge manipulation approaches for k-core minimization: Metrics and analytics

C Chen, Q Zhu, R Sun, X Wang… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
In social networks, dense relationships among users contribute to stable communities.
Breakdowns of critical connections may cause users to leave the group. A popular model to …

Fighting opinion control in social networks via link recommendation

V Amelkin, AK Singh - Proceedings of the 25th ACM SIGKDD …, 2019 - dl.acm.org
The process of opinion formation is inherently a network process, with user opinions in a
social network being driven to a certain average opinion. One simple and intuitive …

Reducing polarization and increasing diverse navigability in graphs by inserting edges and swap** edge weights

S Haddadan, C Menghini, M Riondato… - Data Mining and …, 2022 - Springer
The sets of hyperlinks in web pages, relationship ties in social networks, or sets of
recommendations in recommender systems, have a major impact on the diversity of content …

Reducing exposure to harmful content via graph rewiring

C Coupette, S Neumann, A Gionis - Proceedings of the 29th ACM …, 2023 - dl.acm.org
Most media content consumed today is provided by digital platforms that aggregate input
from diverse sources, where access to information is mediated by recommendation …

Efficient centrality maximization with Rademacher averages

L Pellegrina - Proceedings of the 29th ACM SIGKDD Conference on …, 2023 - dl.acm.org
The identification of the set of k most central nodes of a graph, or centrality maximization, is a
key task in network analysis, with various applications ranging from finding communities in …

Manipulating node similarity measures in networks

P Dey, S Medya - arxiv preprint arxiv:1910.11529, 2019 - arxiv.org
Node similarity measures quantify how similar a pair of nodes are in a network. These
similarity measures turn out to be an important fundamental tool for many real world …