通过部分图卷积网络进行不完整图学习

Ziyan Zhang;Bo Jiang;Jin Tang;Jinhui Tang;Bin Luo
{"title":"通过部分图卷积网络进行不完整图学习","authors":"Ziyan Zhang;Bo Jiang;Jin Tang;Jinhui Tang;Bin Luo","doi":"10.1109/TAI.2024.3386499","DOIUrl":null,"url":null,"abstract":"Graph convolutional networks (GCNs) gain increasing attention on graph data learning tasks in recent years. However, in many applications, graph may come with an incomplete form where attributes of graph nodes are partially unknown/missing. Existing graph convolutions (GCs) are generally designed on complete graphs which cannot deal with attribute-incomplete graph data directly. To address this problem, in this article, we extend standard GC and develop an explicit Partial Graph Convolution (PaGC) for attribute-incomplete graph data. Our PaGC is derived based on the observation that the core neighborhood aggregator in GC operation can be equivalently viewed as an energy minimization model. Based on it, we can define a novel \n<italic>partial aggregation function</i>\n and derive PaGC for incomplete graph data. Experiments demonstrate the effectiveness and efficiency of the proposed PaGCN.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Incomplete Graph Learning via Partial Graph Convolutional Network\",\"authors\":\"Ziyan Zhang;Bo Jiang;Jin Tang;Jinhui Tang;Bin Luo\",\"doi\":\"10.1109/TAI.2024.3386499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph convolutional networks (GCNs) gain increasing attention on graph data learning tasks in recent years. However, in many applications, graph may come with an incomplete form where attributes of graph nodes are partially unknown/missing. Existing graph convolutions (GCs) are generally designed on complete graphs which cannot deal with attribute-incomplete graph data directly. To address this problem, in this article, we extend standard GC and develop an explicit Partial Graph Convolution (PaGC) for attribute-incomplete graph data. Our PaGC is derived based on the observation that the core neighborhood aggregator in GC operation can be equivalently viewed as an energy minimization model. Based on it, we can define a novel \\n<italic>partial aggregation function</i>\\n and derive PaGC for incomplete graph data. Experiments demonstrate the effectiveness and efficiency of the proposed PaGCN.\",\"PeriodicalId\":73305,\"journal\":{\"name\":\"IEEE transactions on artificial intelligence\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on artificial intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10495099/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10495099/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,图卷积网络(GCN)在图数据学习任务中越来越受到关注。然而,在许多应用中,图可能是不完整的,图节点的属性部分未知或缺失。现有的图卷积(GC)一般是针对完整图设计的,无法直接处理属性不完整的图数据。为了解决这个问题,我们在本文中扩展了标准图卷积,并开发了一种用于属性不完整图数据的显式部分图卷积(PaGC)。我们的 PaGC 是在观察到 GC 操作中的核心邻域聚合器可以等同于能量最小化模型的基础上推导出来的。在此基础上,我们可以定义一个新颖的部分聚合函数,并推导出适用于不完整图数据的 PaGC。实验证明了所提出的 PaGCN 的有效性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Incomplete Graph Learning via Partial Graph Convolutional Network
Graph convolutional networks (GCNs) gain increasing attention on graph data learning tasks in recent years. However, in many applications, graph may come with an incomplete form where attributes of graph nodes are partially unknown/missing. Existing graph convolutions (GCs) are generally designed on complete graphs which cannot deal with attribute-incomplete graph data directly. To address this problem, in this article, we extend standard GC and develop an explicit Partial Graph Convolution (PaGC) for attribute-incomplete graph data. Our PaGC is derived based on the observation that the core neighborhood aggregator in GC operation can be equivalently viewed as an energy minimization model. Based on it, we can define a novel partial aggregation function and derive PaGC for incomplete graph data. Experiments demonstrate the effectiveness and efficiency of the proposed PaGCN.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
期刊最新文献
Table of Contents Front Cover IEEE Transactions on Artificial Intelligence Publication Information Front Cover Table of Contents
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1