Influence contribution ratio estimation in social networks

IF 8.1 1区 计算机科学 0 COMPUTER SCIENCE, INFORMATION SYSTEMS Information Sciences Pub Date : 2025-02-04 DOI:10.1016/j.ins.2025.121934
Yingdan Shi , Jingya Zhou , Congcong Zhang , Zhenyu Hu
{"title":"Influence contribution ratio estimation in social networks","authors":"Yingdan Shi ,&nbsp;Jingya Zhou ,&nbsp;Congcong Zhang ,&nbsp;Zhenyu Hu","doi":"10.1016/j.ins.2025.121934","DOIUrl":null,"url":null,"abstract":"<div><div>Social networks are becoming an ideal choice for marketing activities and advertising campaigns due to the explosive growth of social network users. In these advertising campaigns, influential users, such as celebrities, often post or repost the ads to help disseminate product information through the ‘word-of-mouth’ effect in social networks. It is significant to allocate remuneration fairly to these influential users based on their contributions to disseminating ads. To address this, we propose a concept called the influence contribution ratio, which represents the contribution ratio of each influential user to an advertising campaign. We introduce two types of coalitional games to depict the process of influence diffusion from multiple levels, namely macro and micro coalitional games, and propose a metric called InfConR based on the Shapley value in coalitional game theory to measure the influence contribution ratio fairly. A naive method to calculate the InfConR value for each user is to use a Monte Carlo (MC) simulation to enumerate a certain number of cascades for the advertising campaign. However, this method is too time-consuming and not realistic. Therefore, we propose a scheme called ICR, which involves two components: 1) sampling algorithms for InfConR in the Independent Cascade (IC) model and Liner Threshold (LT) model, respectively, and 2) an algorithm with approximation guarantees to minimize the sampling number. Our experiments on four real-world datasets demonstrate the superiority and effectiveness of our scheme.</div></div>","PeriodicalId":51063,"journal":{"name":"Information Sciences","volume":"703 ","pages":"Article 121934"},"PeriodicalIF":8.1000,"publicationDate":"2025-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020025525000660","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"0","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Social networks are becoming an ideal choice for marketing activities and advertising campaigns due to the explosive growth of social network users. In these advertising campaigns, influential users, such as celebrities, often post or repost the ads to help disseminate product information through the ‘word-of-mouth’ effect in social networks. It is significant to allocate remuneration fairly to these influential users based on their contributions to disseminating ads. To address this, we propose a concept called the influence contribution ratio, which represents the contribution ratio of each influential user to an advertising campaign. We introduce two types of coalitional games to depict the process of influence diffusion from multiple levels, namely macro and micro coalitional games, and propose a metric called InfConR based on the Shapley value in coalitional game theory to measure the influence contribution ratio fairly. A naive method to calculate the InfConR value for each user is to use a Monte Carlo (MC) simulation to enumerate a certain number of cascades for the advertising campaign. However, this method is too time-consuming and not realistic. Therefore, we propose a scheme called ICR, which involves two components: 1) sampling algorithms for InfConR in the Independent Cascade (IC) model and Liner Threshold (LT) model, respectively, and 2) an algorithm with approximation guarantees to minimize the sampling number. Our experiments on four real-world datasets demonstrate the superiority and effectiveness of our scheme.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Information Sciences
Information Sciences 工程技术-计算机:信息系统
CiteScore
14.00
自引率
17.30%
发文量
1322
审稿时长
10.4 months
期刊介绍: Informatics and Computer Science Intelligent Systems Applications is an esteemed international journal that focuses on publishing original and creative research findings in the field of information sciences. We also feature a limited number of timely tutorial and surveying contributions. Our journal aims to cater to a diverse audience, including researchers, developers, managers, strategic planners, graduate students, and anyone interested in staying up-to-date with cutting-edge research in information science, knowledge engineering, and intelligent systems. While readers are expected to share a common interest in information science, they come from varying backgrounds such as engineering, mathematics, statistics, physics, computer science, cell biology, molecular biology, management science, cognitive science, neurobiology, behavioral sciences, and biochemistry.
期刊最新文献
Influence contribution ratio estimation in social networks Editorial Board Retraction notice to “Multiple attribute decision making based on MAIRCA, standard deviation-based method, and Pythagorean fuzzy sets” [Inf. Sci. 644 (2023) 119274] Editorial Board Optimising RFID network planning problem using an improved automated approach inspired by artificial neural networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1