一种基于网络最短树围的信息源识别算法

Zhong Li, Chunhe Xia, Tianbo Wang, Xiaochen Liu
{"title":"一种基于网络最短树围的信息源识别算法","authors":"Zhong Li, Chunhe Xia, Tianbo Wang, Xiaochen Liu","doi":"10.1145/3316615.3316686","DOIUrl":null,"url":null,"abstract":"It is of significance to identify the source of malicious information in social networks, since this information diffusion is already a problem, which can seriously affect social stability. In this paper, we develop a propagation path based approach where the estimator of information source is chosen to be the root node associated with the propagation path that most likely leads to the monitored state of network. When the information diffusion process follows the Susceptible-Infected (SI) model and satisfying the instant forwarding hypothesis, we proved that the source estimator we proposed is the root node of the network shortest arborescence. Finally, multiple simulations on networks with different structure show that our method outperforms existing algorithms.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"169 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Information Source Identification Algorithm Based on Shortest Arborescence of Network\",\"authors\":\"Zhong Li, Chunhe Xia, Tianbo Wang, Xiaochen Liu\",\"doi\":\"10.1145/3316615.3316686\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is of significance to identify the source of malicious information in social networks, since this information diffusion is already a problem, which can seriously affect social stability. In this paper, we develop a propagation path based approach where the estimator of information source is chosen to be the root node associated with the propagation path that most likely leads to the monitored state of network. When the information diffusion process follows the Susceptible-Infected (SI) model and satisfying the instant forwarding hypothesis, we proved that the source estimator we proposed is the root node of the network shortest arborescence. Finally, multiple simulations on networks with different structure show that our method outperforms existing algorithms.\",\"PeriodicalId\":268392,\"journal\":{\"name\":\"Proceedings of the 2019 8th International Conference on Software and Computer Applications\",\"volume\":\"169 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 8th International Conference on Software and Computer Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3316615.3316686\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3316615.3316686","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

识别社交网络中恶意信息的来源具有重要意义,因为这些信息的扩散已经成为一个问题,会严重影响社会稳定。本文提出了一种基于传播路径的方法,选择信息源的估计量作为与最可能导致网络被监控状态的传播路径相关联的根节点。当信息扩散过程遵循易感感染(SI)模型并满足即时转发假设时,我们证明了我们提出的源估计量是网络最短树形的根节点。最后,对不同结构的网络进行了多次仿真,结果表明该方法优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Information Source Identification Algorithm Based on Shortest Arborescence of Network
It is of significance to identify the source of malicious information in social networks, since this information diffusion is already a problem, which can seriously affect social stability. In this paper, we develop a propagation path based approach where the estimator of information source is chosen to be the root node associated with the propagation path that most likely leads to the monitored state of network. When the information diffusion process follows the Susceptible-Infected (SI) model and satisfying the instant forwarding hypothesis, we proved that the source estimator we proposed is the root node of the network shortest arborescence. Finally, multiple simulations on networks with different structure show that our method outperforms existing algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信