Shunxin Xiao;Huibin Lin;Jianwen Wang;Xiaolong Qin;Shiping Wang
{"title":"图神经网络的多关系增强","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":"{\"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}","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}
Multi-Relation Augmentation for Graph Neural Networks
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.
期刊介绍:
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.