Multi-Relation Augmentation for Graph Neural Networks

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Shunxin Xiao;Huibin Lin;Jianwen Wang;Xiaolong Qin;Shiping Wang
{"title":"Multi-Relation Augmentation for Graph Neural Networks","authors":"Shunxin Xiao;Huibin Lin;Jianwen Wang;Xiaolong Qin;Shiping Wang","doi":"10.1109/TETCI.2024.3371214","DOIUrl":null,"url":null,"abstract":"Data augmentation has been successfully utilized to refine the generalization capability and performance of learning algorithms in image and text analysis. With the rising focus on graph neural networks, an increasing number of researchers are employing various data augmentation approaches to improve graph learning techniques. Although significant improvements have been made, most of them are implemented by manipulating nodes or edges to generate modified graphs as augmented views, which might lose the information hidden in the input data. To address this issue, we propose a simple but effective data augmentation framework termed multi-relation augmentation designed for existing graph neural networks. Different from prior works, the designed model utilizes various methods to simulate multiple adjacency relationships (multi-relation) among nodes as augmented views instead of manipulating the original graph. The proposed augmentation framework can be formulated as three sub-modules, each offering distinct advantages: 1) The encoder module and projection module form a shared contrastive learning framework for both the original graph and all augmented views. Due to the shared mechanism, the proposed method can be simply applied to various graph learning models. 2) The designed task-specific module flexibly extends the proposed framework for various machine learning tasks. Experimental results on several databases show that the introduced augmentation framework improves the performance of existing graph neural networks on both semi-supervised node classification and unsupervised clustering tasks. It demonstrates that multiple relations mechanism is efficient for graph-based augmentation.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"8 5","pages":"3614-3627"},"PeriodicalIF":5.3000,"publicationDate":"2024-03-21","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/10477617/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Data augmentation has been successfully utilized to refine the generalization capability and performance of learning algorithms in image and text analysis. With the rising focus on graph neural networks, an increasing number of researchers are employing various data augmentation approaches to improve graph learning techniques. Although significant improvements have been made, most of them are implemented by manipulating nodes or edges to generate modified graphs as augmented views, which might lose the information hidden in the input data. To address this issue, we propose a simple but effective data augmentation framework termed multi-relation augmentation designed for existing graph neural networks. Different from prior works, the designed model utilizes various methods to simulate multiple adjacency relationships (multi-relation) among nodes as augmented views instead of manipulating the original graph. The proposed augmentation framework can be formulated as three sub-modules, each offering distinct advantages: 1) The encoder module and projection module form a shared contrastive learning framework for both the original graph and all augmented views. Due to the shared mechanism, the proposed method can be simply applied to various graph learning models. 2) The designed task-specific module flexibly extends the proposed framework for various machine learning tasks. Experimental results on several databases show that the introduced augmentation framework improves the performance of existing graph neural networks on both semi-supervised node classification and unsupervised clustering tasks. It demonstrates that multiple relations mechanism is efficient for graph-based augmentation.
图神经网络的多关系增强
在图像和文本分析领域,数据增强已被成功地用于提高学习算法的泛化能力和性能。随着图神经网络日益受到关注,越来越多的研究人员开始采用各种数据增强方法来改进图学习技术。虽然已经取得了重大改进,但大多数改进都是通过操作节点或边缘来生成修改后的图作为增强视图,这可能会丢失隐藏在输入数据中的信息。为了解决这个问题,我们提出了一个简单而有效的数据增强框架,即针对现有图神经网络设计的多关联增强。与之前的工作不同,所设计的模型利用各种方法模拟节点之间的多重邻接关系(多重关系),作为增强视图,而不是操作原始图。拟议的增强框架可表述为三个子模块,每个模块都具有独特的优势:1) 编码器模块和投影模块为原始图和所有增强视图形成了一个共享的对比学习框架。由于共享机制,所提出的方法可以简单地应用于各种图学习模型。2) 所设计的特定任务模块灵活地扩展了所提出的框架,适用于各种机器学习任务。在多个数据库上的实验结果表明,引入的增强框架提高了现有图神经网络在半监督节点分类和无监督聚类任务上的性能。它证明了多重关系机制对于基于图的增强是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
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学术官方微信