arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.10053cs.SI
收藏

使用低秩更新建模时间线算法对观点动态的影响

Modeling the Impact of Timeline Algorithms on Opinion Dynamics Using Low-rank Updates

Tianyi Zhou, Stefan Neumann, Kiran Garimella, Aristides Gionis

AI总结:

本文提出一种基于Friedkin-Johnsen模型的方法,通过低秩更新建模时间线算法对观点动态的影响,并设计梯度下降算法在近线性时间内最小化网络极化与分歧,同时发布了包含超2.7万节点的数据集。

摘要:

时间线算法是在线社交网络的关键组成部分,但近年来它被指责加剧了社会的极化和分歧。观点动态模型已被用于研究在线社交网络中的各种现象,但一个悬而未决的问题是,如何增强这些模型以考虑用户级时间线算法的细粒度影响。我们在该问题上取得进展,提供了一种建模时间线算法对观点动态影响的方法。具体而言,我们展示了如何基于从时间线数据中提取的聚合信息来增强流行的Friedkin-Johnsen观点形成模型。我们使用该模型研究最小化极化和分歧的问题;假设允许通过对某些讨论主题进行强化和对其他主题进行惩罚,来对用户的时间线构成进行微小更改。我们提出了一种基于梯度下降的算法来解决此问题,并证明在现实参数设置下,该算法在 $\tilde{O}(m\sqrt{n} \lg(1/\varepsilon))$ 时间内计算出 $(1+\varepsilon)$-近似解,其中 $m$ 是图中的边数,$n$ 是顶点数。我们还提出了一种算法,可证明在近线性时间内计算出我们模型的 $\varepsilon$-近似。我们在真实数据上评估了该方法,并表明它有效减少了网络中的极化和分歧。最后,我们发布了一个带有真实观点且包含超过27,000个节点的匿名图数据集(此前最大的公开数据集包含不到550个节点)。

英文摘要:

Timeline algorithms are key parts of online social networks, but during recent years they have been blamed for increasing polarization and disagreement in our society. Opinion-dynamics models have been used to study a variety of phenomena in online social networks, but an open question remains on how these models can be augmented to take into account the fine-grained impact of user-level timeline algorithms. We make progress on this question by providing a way to model the impact of timeline algorithms on opinion dynamics. Specifically, we show how the popular Friedkin--Johnsen opinion-formation model can be augmented based on aggregate information, extracted from timeline data. We use our model to study the problem of minimizing the polarization and disagreement; we assume that we are allowed to make small changes to the users' timeline compositions by strengthening some topics of discussion and penalizing some others. We present a gradient descent-based algorithm for this problem, and show that under realistic parameter settings, our algorithm computes a $(1+\varepsilon)$-approximate solution in time $\tilde{O}(m\sqrt{n} \lg(1/\varepsilon))$, where $m$ is the number of edges in the graph and $n$ is the number of vertices. We also present an algorithm that provably computes an $\varepsilon$-approximation of our model in near-linear time. We evaluate our method on real-world data and show that it effectively reduces the polarization and disagreement in the network. Finally, we release an anonymized graph dataset with ground-truth opinions and more than 27\,000 nodes (the previously largest publicly available dataset contains less than 550 nodes).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑