独立级联模型中激活概率的计算

Wenjing Yang, L. Brenner, A. Giua
{"title":"独立级联模型中激活概率的计算","authors":"Wenjing Yang, L. Brenner, A. Giua","doi":"10.1109/CoDIT.2018.8394923","DOIUrl":null,"url":null,"abstract":"Based on the concepts of word-of-mouth effect and viral marketing, the diffusion of an innovation may be triggered starting from a set of initial users. Estimating the influence spread is a preliminary step to determine a suitable or even optimal set of initial users to reach a given goal. In this paper, we focus on a stochastic model called the Independent Cascade model, and compare a few approaches to compute activation probabilities of nodes in a social network, i.e., the probability that a user adopts the innovation. In the paper, first we propose the Path Method which computes the exact value of the activation probabilities but it has high complexity. Second an approximated method, called SSS-Noself, is obtained by modification of the existing SteadyStateSpread algorithm, based on fixed-point computation, to achieve a better accuracy. Finally an efficient approach, also based on fixed-point computation, is proposed to compute the probability that a node is activated though a path of minimal length from the seed set. This algorithm, called SSS-Bound-t algorithm, can provide a lower-bound for the computation of activation probabilities.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"45 15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Computation of Activation Probabilities in the Independent Cascade Model\",\"authors\":\"Wenjing Yang, L. Brenner, A. Giua\",\"doi\":\"10.1109/CoDIT.2018.8394923\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the concepts of word-of-mouth effect and viral marketing, the diffusion of an innovation may be triggered starting from a set of initial users. Estimating the influence spread is a preliminary step to determine a suitable or even optimal set of initial users to reach a given goal. In this paper, we focus on a stochastic model called the Independent Cascade model, and compare a few approaches to compute activation probabilities of nodes in a social network, i.e., the probability that a user adopts the innovation. In the paper, first we propose the Path Method which computes the exact value of the activation probabilities but it has high complexity. Second an approximated method, called SSS-Noself, is obtained by modification of the existing SteadyStateSpread algorithm, based on fixed-point computation, to achieve a better accuracy. Finally an efficient approach, also based on fixed-point computation, is proposed to compute the probability that a node is activated though a path of minimal length from the seed set. This algorithm, called SSS-Bound-t algorithm, can provide a lower-bound for the computation of activation probabilities.\",\"PeriodicalId\":128011,\"journal\":{\"name\":\"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"volume\":\"45 15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoDIT.2018.8394923\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT.2018.8394923","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

根据口碑效应和病毒式营销的概念,创新的扩散可能是从一组初始用户开始触发的。估计影响范围是确定一组合适的甚至是最优的初始用户以达到给定目标的初步步骤。在本文中,我们重点研究了一种称为独立级联模型的随机模型,并比较了几种计算社交网络中节点激活概率的方法,即用户采用创新的概率。本文首先提出了路径法,该方法计算激活概率的精确值,但其复杂度较高。其次,基于不动点计算,对现有的SteadyStateSpread算法进行改进,得到了一种近似的方法,称为ss - noself,以达到更好的精度。最后,提出了一种同样基于不动点计算的有效方法来计算从种子集出发的最小长度路径激活节点的概率。该算法为激活概率的计算提供了一个下界,称为SSS-Bound-t算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computation of Activation Probabilities in the Independent Cascade Model
Based on the concepts of word-of-mouth effect and viral marketing, the diffusion of an innovation may be triggered starting from a set of initial users. Estimating the influence spread is a preliminary step to determine a suitable or even optimal set of initial users to reach a given goal. In this paper, we focus on a stochastic model called the Independent Cascade model, and compare a few approaches to compute activation probabilities of nodes in a social network, i.e., the probability that a user adopts the innovation. In the paper, first we propose the Path Method which computes the exact value of the activation probabilities but it has high complexity. Second an approximated method, called SSS-Noself, is obtained by modification of the existing SteadyStateSpread algorithm, based on fixed-point computation, to achieve a better accuracy. Finally an efficient approach, also based on fixed-point computation, is proposed to compute the probability that a node is activated though a path of minimal length from the seed set. This algorithm, called SSS-Bound-t algorithm, can provide a lower-bound for the computation of activation probabilities.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信