社会网络中有序意见的扩散:一个基于主体的竞选模型与启发式

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Xiaoxue Liu;Shohei Kato;Wen Gu;Fenghui Ren;Guoxin Su;Minjie Zhang
{"title":"社会网络中有序意见的扩散:一个基于主体的竞选模型与启发式","authors":"Xiaoxue Liu;Shohei Kato;Wen Gu;Fenghui Ren;Guoxin Su;Minjie Zhang","doi":"10.1109/TCSS.2024.3458950","DOIUrl":null,"url":null,"abstract":"Most research investigating how social influence affects election results mainly uses diffusion models for binary opinions. However, these diffusion models are progressive and focus on the diffusion of one opinion. In this article, we introduce a general diffusion model for ordinal opinions expressed as linear orderings over a finite set of candidates. We employ agent-based modeling to simulate a nonprogressive diffusion process, allowing multiple types of opinion diffusion about different candidates. The proposed agent-based diffusion model can forecast long-term trends of opinion diffusion in social networks by capturing voters’ personalized features and incorporating dynamic social contexts. Furthermore, we examine the possibility of affecting election outcomes by externally changing the ordinal opinions of certain vertices, i.e., campaigning. Since finding influential voters from the social network is computationally challenging, we propose a heuristic approach, i.e., backward influence rank (BIR). Experimental results demonstrate that the proposed BIR approach is superior to the classic greedy approach for campaigning by achieving a similar margin of victory to that of the greedy approach but running two orders of magnitude faster than the greedy approach did.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"12 1","pages":"335-347"},"PeriodicalIF":4.5000,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Diffusion of Ordinal Opinions in Social Networks: An Agent-Based Model and Heuristics for Campaigning\",\"authors\":\"Xiaoxue Liu;Shohei Kato;Wen Gu;Fenghui Ren;Guoxin Su;Minjie Zhang\",\"doi\":\"10.1109/TCSS.2024.3458950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most research investigating how social influence affects election results mainly uses diffusion models for binary opinions. However, these diffusion models are progressive and focus on the diffusion of one opinion. In this article, we introduce a general diffusion model for ordinal opinions expressed as linear orderings over a finite set of candidates. We employ agent-based modeling to simulate a nonprogressive diffusion process, allowing multiple types of opinion diffusion about different candidates. The proposed agent-based diffusion model can forecast long-term trends of opinion diffusion in social networks by capturing voters’ personalized features and incorporating dynamic social contexts. Furthermore, we examine the possibility of affecting election outcomes by externally changing the ordinal opinions of certain vertices, i.e., campaigning. Since finding influential voters from the social network is computationally challenging, we propose a heuristic approach, i.e., backward influence rank (BIR). Experimental results demonstrate that the proposed BIR approach is superior to the classic greedy approach for campaigning by achieving a similar margin of victory to that of the greedy approach but running two orders of magnitude faster than the greedy approach did.\",\"PeriodicalId\":13044,\"journal\":{\"name\":\"IEEE Transactions on Computational Social Systems\",\"volume\":\"12 1\",\"pages\":\"335-347\"},\"PeriodicalIF\":4.5000,\"publicationDate\":\"2024-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Computational Social Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10712164/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10712164/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

大多数调查社会影响如何影响选举结果的研究主要使用二元观点的扩散模型。然而,这些扩散模型是渐进的,并且侧重于一种观点的扩散。在这篇文章中,我们引入了在有限候选集合上用线性排序表示的有序意见的一般扩散模型。我们采用基于智能体的建模来模拟非渐进式扩散过程,允许针对不同候选人的多种类型的意见扩散。提出的基于主体的扩散模型通过捕捉选民的个性化特征,结合动态的社会环境,可以预测社会网络中意见扩散的长期趋势。此外,我们研究了通过外部改变某些顶点的有序意见(即竞选活动)来影响选举结果的可能性。由于从社会网络中寻找有影响力的选民在计算上具有挑战性,我们提出了一种启发式方法,即向后影响力排名(BIR)。实验结果表明,提出的BIR方法优于经典的贪婪方法,获得了与贪婪方法相似的胜利幅度,但运行速度比贪婪方法快两个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Diffusion of Ordinal Opinions in Social Networks: An Agent-Based Model and Heuristics for Campaigning
Most research investigating how social influence affects election results mainly uses diffusion models for binary opinions. However, these diffusion models are progressive and focus on the diffusion of one opinion. In this article, we introduce a general diffusion model for ordinal opinions expressed as linear orderings over a finite set of candidates. We employ agent-based modeling to simulate a nonprogressive diffusion process, allowing multiple types of opinion diffusion about different candidates. The proposed agent-based diffusion model can forecast long-term trends of opinion diffusion in social networks by capturing voters’ personalized features and incorporating dynamic social contexts. Furthermore, we examine the possibility of affecting election outcomes by externally changing the ordinal opinions of certain vertices, i.e., campaigning. Since finding influential voters from the social network is computationally challenging, we propose a heuristic approach, i.e., backward influence rank (BIR). Experimental results demonstrate that the proposed BIR approach is superior to the classic greedy approach for campaigning by achieving a similar margin of victory to that of the greedy approach but running two orders of magnitude faster than the greedy approach did.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信