{"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":"5 9","pages":"4315-4321"},"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\":\"5 9\",\"pages\":\"4315-4321\"},\"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}
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.