A Malicious Information Traceability Model Based on Neighborhood Similarity and Multiple Types of Interaction

IF 4.5 2区 计算机科学 Q1 COMPUTER SCIENCE, CYBERNETICS
Tun Li;Zhou Li;Kexin Ma;Qian Li;Rong Wang;Chaolong Jia;Yunpeng Xiao
{"title":"A Malicious Information Traceability Model Based on Neighborhood Similarity and Multiple Types of Interaction","authors":"Tun Li;Zhou Li;Kexin Ma;Qian Li;Rong Wang;Chaolong Jia;Yunpeng Xiao","doi":"10.1109/TCSS.2024.3385025","DOIUrl":null,"url":null,"abstract":"The open and free nature of online platforms presents challenges for tracing malicious information. To address this, we propose a traceability model based on neighborhood similarity and multitype interaction. First, we propose neighborhood similarity algorithms (D-NTC) to address the universality of malicious information dissemination. This algorithm evaluates the impact of user node importance on malicious information propagation by combining node degrees and the topological overlap of neighboring nodes. Second, we consider the interactive nature of multiple types of elements in the network and construct an interactive module based on user-path-malicious information. This module effectively captures the mutual influence relationships among diverse elements. Additionally, we employ representation learning to optimize the transition probability matrix between elements, leveraging hidden relationships to further characterize their interactive impact. Finally, we propose the NSMTI-Rank algorithm, which tackles the complexity of quantifying the influence of multiple types of elements. Drawing inspiration from mutual reinforcement effects, NSMTI-Rank comprehensively quantifies element influence through an iterative framework. Experimental results demonstrate the effectiveness of our approach in mining user node importance and capturing the interaction information among diverse elements in the network. Moreover, it enables the timely and effective identification of sources of malicious information dissemination.","PeriodicalId":13044,"journal":{"name":"IEEE Transactions on Computational Social Systems","volume":"11 5","pages":"5815-5827"},"PeriodicalIF":4.5000,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Computational Social Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10509577/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, CYBERNETICS","Score":null,"Total":0}
引用次数: 0

Abstract

The open and free nature of online platforms presents challenges for tracing malicious information. To address this, we propose a traceability model based on neighborhood similarity and multitype interaction. First, we propose neighborhood similarity algorithms (D-NTC) to address the universality of malicious information dissemination. This algorithm evaluates the impact of user node importance on malicious information propagation by combining node degrees and the topological overlap of neighboring nodes. Second, we consider the interactive nature of multiple types of elements in the network and construct an interactive module based on user-path-malicious information. This module effectively captures the mutual influence relationships among diverse elements. Additionally, we employ representation learning to optimize the transition probability matrix between elements, leveraging hidden relationships to further characterize their interactive impact. Finally, we propose the NSMTI-Rank algorithm, which tackles the complexity of quantifying the influence of multiple types of elements. Drawing inspiration from mutual reinforcement effects, NSMTI-Rank comprehensively quantifies element influence through an iterative framework. Experimental results demonstrate the effectiveness of our approach in mining user node importance and capturing the interaction information among diverse elements in the network. Moreover, it enables the timely and effective identification of sources of malicious information dissemination.
基于邻域相似性和多类型交互的恶意信息溯源模型
网络平台的开放性和自由性给追踪恶意信息带来了挑战。为此,我们提出了一种基于邻域相似性和多类互动的追溯模型。首先,我们提出了邻域相似性算法(D-NTC)来解决恶意信息传播的普遍性问题。该算法通过结合节点度和相邻节点的拓扑重叠度来评估用户节点重要性对恶意信息传播的影响。其次,我们考虑到网络中多类元素的交互性,构建了基于用户路径-恶意信息的交互模块。该模块能有效捕捉不同元素之间的相互影响关系。此外,我们还利用表征学习来优化元素之间的转换概率矩阵,利用隐藏关系来进一步描述其交互影响。最后,我们提出了 NSMTI-Rank 算法,以解决量化多类元素影响的复杂性问题。NSMTI-Rank 从相互强化效应中汲取灵感,通过迭代框架全面量化元素的影响。实验结果证明了我们的方法在挖掘用户节点重要性和捕捉网络中不同元素之间的交互信息方面的有效性。此外,它还能及时有效地识别恶意信息传播源。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Computational Social Systems
IEEE Transactions on Computational Social Systems Social Sciences-Social Sciences (miscellaneous)
CiteScore
10.00
自引率
20.00%
发文量
316
期刊介绍: IEEE Transactions on Computational Social Systems focuses on such topics as modeling, simulation, analysis and understanding of social systems from the quantitative and/or computational perspective. "Systems" include man-man, man-machine and machine-machine organizations and adversarial situations as well as social media structures and their dynamics. More specifically, the proposed transactions publishes articles on modeling the dynamics of social systems, methodologies for incorporating and representing socio-cultural and behavioral aspects in computational modeling, analysis of social system behavior and structure, and paradigms for social systems modeling and simulation. The journal also features articles on social network dynamics, social intelligence and cognition, social systems design and architectures, socio-cultural modeling and representation, and computational behavior modeling, and their applications.
×
引用
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学术官方微信