{"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}
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.