面向图节点分类的信息感知消息传递神经网络

Li Zhou, Chunbo Jia, Jianfeng Zhang
{"title":"面向图节点分类的信息感知消息传递神经网络","authors":"Li Zhou, Chunbo Jia, Jianfeng Zhang","doi":"10.1145/3432291.3432294","DOIUrl":null,"url":null,"abstract":"In this paper, we present an information-aware message passing neural network (MPNN) to improve the effectiveness of weight calculation in the message passing process for node classification problems on a graph. Related researches are theoretically analyzed to introduce a special information interchanging scheme with precise weight generation. Compared to fix weighted message passing in convolutional networks (GCN) and neural network computed message coefficient in graph attention networks (GAT), the proposed information-aware message passing neural network takes advantage of node feature and its hidden representations, which indicate the amount of information should be passed and how to absorb the message between node neighbours. This exact message-passing method with self-learning for weight on each dimension of feature achieves better accuracy for node classification tasks in graph neural networks. The proposed method is evaluated by semi-supervised graph node classification task on citation network dataset. Obtained results show the correctness of the proposed method which are more accurate than that of GCN and GAT result.","PeriodicalId":126684,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Information-aware Message Passing Neural Networks for Graph Node Classification\",\"authors\":\"Li Zhou, Chunbo Jia, Jianfeng Zhang\",\"doi\":\"10.1145/3432291.3432294\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an information-aware message passing neural network (MPNN) to improve the effectiveness of weight calculation in the message passing process for node classification problems on a graph. Related researches are theoretically analyzed to introduce a special information interchanging scheme with precise weight generation. Compared to fix weighted message passing in convolutional networks (GCN) and neural network computed message coefficient in graph attention networks (GAT), the proposed information-aware message passing neural network takes advantage of node feature and its hidden representations, which indicate the amount of information should be passed and how to absorb the message between node neighbours. This exact message-passing method with self-learning for weight on each dimension of feature achieves better accuracy for node classification tasks in graph neural networks. The proposed method is evaluated by semi-supervised graph node classification task on citation network dataset. Obtained results show the correctness of the proposed method which are more accurate than that of GCN and GAT result.\",\"PeriodicalId\":126684,\"journal\":{\"name\":\"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3432291.3432294\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Signal Processing and Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3432291.3432294","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

为了提高图上节点分类问题在消息传递过程中权重计算的有效性,提出了一种信息感知的消息传递神经网络(MPNN)。对相关研究进行了理论分析,提出了一种具有精确权值生成的特殊信息交换方案。与卷积网络(GCN)的固定加权消息传递和图注意网络(GAT)的神经网络计算消息系数相比,所提出的信息感知消息传递神经网络利用了节点特征及其隐含表示,表明了节点间应该传递的信息量以及如何吸收相邻节点间的消息。这种具有自学习特征各维权值的精确消息传递方法对图神经网络中的节点分类任务具有更好的准确性。在引文网络数据集上用半监督图节点分类任务对该方法进行了评价。仿真结果表明了该方法的正确性,比GCN和GAT的结果更准确。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Information-aware Message Passing Neural Networks for Graph Node Classification
In this paper, we present an information-aware message passing neural network (MPNN) to improve the effectiveness of weight calculation in the message passing process for node classification problems on a graph. Related researches are theoretically analyzed to introduce a special information interchanging scheme with precise weight generation. Compared to fix weighted message passing in convolutional networks (GCN) and neural network computed message coefficient in graph attention networks (GAT), the proposed information-aware message passing neural network takes advantage of node feature and its hidden representations, which indicate the amount of information should be passed and how to absorb the message between node neighbours. This exact message-passing method with self-learning for weight on each dimension of feature achieves better accuracy for node classification tasks in graph neural networks. The proposed method is evaluated by semi-supervised graph node classification task on citation network dataset. Obtained results show the correctness of the proposed method which are more accurate than that of GCN and GAT result.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信