arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.06756cs.SIcs.DB
收藏

基于投票的意见最大化

Voting-based Opinion Maximization

Arkaprava Saha, Xiangyu Ke, Arijit Khan, Laks V. S. Lakshmanan

摘要:

我们研究了新的问题,基于投票的意见最大化的社会网络:找到一个给定数量的种子节点的目标竞选者,在其他竞争活动的存在下,以最大限度地提高基于投票的得分为目标竞选者在给定的时间范围。大部分影响力最大化文献假设社交网络用户只能在两个离散状态之间切换,即非活动状态和活动状态,并且切换的选择在一次激活时被冻结。实际上,即使当具有偏好意见时,用户也可能不完全鄙视其他意见,并且偏好水平可能由于社会影响而随时间变化。为此,我们采用植根于意见形成和扩散的模型,并使用几个基于投票的分数来确定用户在给定时间范围内对多个竞选者中的每一个的投票。我们的问题是NP-难和非次模的各种分数。我们设计贪婪的种子选择算法,通过三明治近似的评分函数的质量保证。为了提高效率,我们开发了随机游走和基于草图的意见计算,质量保证。实证结果验证了我们的有效性,效率和可扩展性。

英文摘要:

We investigate the novel problem of voting-based opinion maximization in a social network: Find a given number of seed nodes for a target campaigner, in the presence of other competing campaigns, so as to maximize a voting-based score for the target campaigner at a given time horizon. The bulk of the influence maximization literature assumes that social network users can switch between only two discrete states, inactive and active, and the choice to switch is frozen upon one-time activation. In reality, even when having a preferred opinion, a user may not completely despise the other opinions, and the preference level may vary over time due to social influence. To this end, we employ models rooted in opinion formation and diffusion, and use several voting-based scores to determine a user's vote for each of the multiple campaigners at a given time horizon. Our problem is NP-hard and non-submodular for various scores. We design greedy seed selection algorithms with quality guarantees for our scoring functions via sandwich approximation. To improve the efficiency, we develop random walk and sketch-based opinion computation, with quality guarantees. Empirical results validate our effectiveness, efficiency, and scalability.

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

↑