基于可解释人工智能的社交网络信息传播隐私保护方法:一种增量技术

IF 1.9 Q3 COMPUTER SCIENCE, CYBERNETICS
Shoayee Alotaibi, Kusum Yadav
{"title":"基于可解释人工智能的社交网络信息传播隐私保护方法:一种增量技术","authors":"Shoayee Alotaibi, Kusum Yadav","doi":"10.1109/MSMC.2022.3188406","DOIUrl":null,"url":null,"abstract":"This article aims to address the issues above by defining a social network information transmission model with the amalgamation of explainable artificial intelligence (XAI) compatible with the paranormal connection. It suggests a way of information transmission called local greedy that aids in the preservation of user privacy. Its impact acts as a buffer between the conflicting interests of privacy protection and information dissemination. Aiming at the enumeration problem of seed set selection, an incremental technique is presented for constructing seed sets to minimize time overhead; a local influence subgraph method for computing nodes is also proposed to evaluate the influence of seed set propagation rapidly. The group meets privacy protection conditions. A strategy is presented to determine the upper bound on the likelihood of a node leaking state without resorting to the time-consuming Monte Carlo approach with XAI on the crawled Sina Weibo dataset. The suggested technique is validated experimentally and by example analysis, and the findings demonstrate its usefulness.","PeriodicalId":43649,"journal":{"name":"IEEE Systems Man and Cybernetics Magazine","volume":"21 1","pages":"44-47"},"PeriodicalIF":1.9000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Explainable Artificial-Intelligence-Based Privacy Preservation Approach for Information Dissemination on Social Networks: An Incremental Technique\",\"authors\":\"Shoayee Alotaibi, Kusum Yadav\",\"doi\":\"10.1109/MSMC.2022.3188406\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article aims to address the issues above by defining a social network information transmission model with the amalgamation of explainable artificial intelligence (XAI) compatible with the paranormal connection. It suggests a way of information transmission called local greedy that aids in the preservation of user privacy. Its impact acts as a buffer between the conflicting interests of privacy protection and information dissemination. Aiming at the enumeration problem of seed set selection, an incremental technique is presented for constructing seed sets to minimize time overhead; a local influence subgraph method for computing nodes is also proposed to evaluate the influence of seed set propagation rapidly. The group meets privacy protection conditions. A strategy is presented to determine the upper bound on the likelihood of a node leaking state without resorting to the time-consuming Monte Carlo approach with XAI on the crawled Sina Weibo dataset. The suggested technique is validated experimentally and by example analysis, and the findings demonstrate its usefulness.\",\"PeriodicalId\":43649,\"journal\":{\"name\":\"IEEE Systems Man and Cybernetics Magazine\",\"volume\":\"21 1\",\"pages\":\"44-47\"},\"PeriodicalIF\":1.9000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Systems Man and Cybernetics Magazine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MSMC.2022.3188406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, CYBERNETICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Man and Cybernetics Magazine","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSMC.2022.3188406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

摘要

本文旨在通过定义一个与超自然联系兼容的可解释人工智能(XAI)融合的社会网络信息传播模型来解决上述问题。它提出了一种称为局部贪婪的信息传输方式,有助于保护用户隐私。它的作用是在隐私保护和信息传播的利益冲突之间起到缓冲作用。针对种子集选择的枚举问题,提出了一种构造种子集的增量方法,使时间开销最小;为了快速评估种子集传播的影响,提出了计算节点的局部影响子图方法。该群组符合隐私保护条件。提出了一种策略来确定节点泄漏状态可能性的上界,而不诉诸耗时的蒙特卡罗方法,在抓取的新浪微博数据集上使用XAI。通过实验和实例分析验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Explainable Artificial-Intelligence-Based Privacy Preservation Approach for Information Dissemination on Social Networks: An Incremental Technique
This article aims to address the issues above by defining a social network information transmission model with the amalgamation of explainable artificial intelligence (XAI) compatible with the paranormal connection. It suggests a way of information transmission called local greedy that aids in the preservation of user privacy. Its impact acts as a buffer between the conflicting interests of privacy protection and information dissemination. Aiming at the enumeration problem of seed set selection, an incremental technique is presented for constructing seed sets to minimize time overhead; a local influence subgraph method for computing nodes is also proposed to evaluate the influence of seed set propagation rapidly. The group meets privacy protection conditions. A strategy is presented to determine the upper bound on the likelihood of a node leaking state without resorting to the time-consuming Monte Carlo approach with XAI on the crawled Sina Weibo dataset. The suggested technique is validated experimentally and by example analysis, and the findings demonstrate its usefulness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Systems Man and Cybernetics Magazine
IEEE Systems Man and Cybernetics Magazine COMPUTER SCIENCE, CYBERNETICS-
自引率
6.20%
发文量
60
×
引用
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学术官方微信