抵御对抗性攻击的多视图图对比学习框架

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Feilong Cao;Xing Ye;Hailiang Ye
{"title":"抵御对抗性攻击的多视图图对比学习框架","authors":"Feilong Cao;Xing Ye;Hailiang Ye","doi":"10.1109/TETCI.2024.3382230","DOIUrl":null,"url":null,"abstract":"Graph neural networks are easily deceived by adversarial attacks that intentionally modify the graph structure. Particularly, homophilous edges connecting similar nodes can be maliciously deleted when adversarial edges are inserted into the graph. Graph structure learning (GSL) reconstructs an optimal graph structure and corresponding representation and has recently received considerable attention in adversarial attacks. However, constrained by a single topology view of the poisoned graph and few labels, most GSL techniques are difficult to effectively learn robust representations that sufficiently carry precise structure information and similar node information. Therefore, this paper develops a robust multi-view graph contrastive learning (RM-GCL) framework to defend against adversarial attacks. It exploits additional structural information and contrastive supervision signals from the data to guide graph structure optimization. In particular, an adaptive graph-augmented contrastive learning (AGCL) module is devised to obtain reliable representations. Besides, a node-level attention mechanism is incorporated to fuse these representations adaptively acquired from AGCL and then complete node classification tasks. Experiments on multiple datasets manifest that RM-GCL exceeds the state-of-the-art approaches and successfully defends against various attacks.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"8 6","pages":"4022-4032"},"PeriodicalIF":5.3000,"publicationDate":"2024-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Multi-View Graph Contrastive Learning Framework for Defending Against Adversarial Attacks\",\"authors\":\"Feilong Cao;Xing Ye;Hailiang Ye\",\"doi\":\"10.1109/TETCI.2024.3382230\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph neural networks are easily deceived by adversarial attacks that intentionally modify the graph structure. Particularly, homophilous edges connecting similar nodes can be maliciously deleted when adversarial edges are inserted into the graph. Graph structure learning (GSL) reconstructs an optimal graph structure and corresponding representation and has recently received considerable attention in adversarial attacks. However, constrained by a single topology view of the poisoned graph and few labels, most GSL techniques are difficult to effectively learn robust representations that sufficiently carry precise structure information and similar node information. Therefore, this paper develops a robust multi-view graph contrastive learning (RM-GCL) framework to defend against adversarial attacks. It exploits additional structural information and contrastive supervision signals from the data to guide graph structure optimization. In particular, an adaptive graph-augmented contrastive learning (AGCL) module is devised to obtain reliable representations. Besides, a node-level attention mechanism is incorporated to fuse these representations adaptively acquired from AGCL and then complete node classification tasks. Experiments on multiple datasets manifest that RM-GCL exceeds the state-of-the-art approaches and successfully defends against various attacks.\",\"PeriodicalId\":13135,\"journal\":{\"name\":\"IEEE Transactions on Emerging Topics in Computational Intelligence\",\"volume\":\"8 6\",\"pages\":\"4022-4032\"},\"PeriodicalIF\":5.3000,\"publicationDate\":\"2024-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Emerging Topics in Computational Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10494404/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10494404/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

图神经网络很容易被故意修改图结构的恶意攻击所欺骗。特别是,当对抗性边缘被插入图中时,连接相似节点的同亲边缘会被恶意删除。图结构学习(GSL)可重建最佳图结构和相应的表示,最近在对抗性攻击中受到广泛关注。然而,受制于中毒图的单一拓扑视图和少量标签,大多数 GSL 技术难以有效学习到能充分承载精确结构信息和相似节点信息的鲁棒表示。因此,本文开发了一种鲁棒多视图图对比学习(RM-GCL)框架,以抵御对抗性攻击。它利用数据中的附加结构信息和对比监督信号来指导图结构优化。特别是,它设计了一个自适应图增强对比学习(AGCL)模块,以获得可靠的表征。此外,还加入了节点级关注机制,以融合 AGCL 自适应获得的这些表征,然后完成节点分类任务。在多个数据集上的实验表明,RM-GCL 超越了最先进的方法,并成功抵御了各种攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Multi-View Graph Contrastive Learning Framework for Defending Against Adversarial Attacks
Graph neural networks are easily deceived by adversarial attacks that intentionally modify the graph structure. Particularly, homophilous edges connecting similar nodes can be maliciously deleted when adversarial edges are inserted into the graph. Graph structure learning (GSL) reconstructs an optimal graph structure and corresponding representation and has recently received considerable attention in adversarial attacks. However, constrained by a single topology view of the poisoned graph and few labels, most GSL techniques are difficult to effectively learn robust representations that sufficiently carry precise structure information and similar node information. Therefore, this paper develops a robust multi-view graph contrastive learning (RM-GCL) framework to defend against adversarial attacks. It exploits additional structural information and contrastive supervision signals from the data to guide graph structure optimization. In particular, an adaptive graph-augmented contrastive learning (AGCL) module is devised to obtain reliable representations. Besides, a node-level attention mechanism is incorporated to fuse these representations adaptively acquired from AGCL and then complete node classification tasks. Experiments on multiple datasets manifest that RM-GCL exceeds the state-of-the-art approaches and successfully defends against various attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
×
引用
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学术官方微信