arrow
返回

Graph convolutional networks for graphs containing missing features

delete2021-04-01
delete62
delete
OA
AI
H
Hibiki Taguchi
X
Xin Liu *
T
Tsuyoshi Murata
DOI:10.1016/j.future.2020.11.016delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graph Convolutional Network (GCN) has experienced great success in graph analysis tasks. It works by smoothing the node features across the graph. The current GCN models overwhelmingly assume that the node feature information is complete. However, real-world graph data are often incomplete and containing missing features. Traditionally, people have to estimate and fill in the unknown features based on imputation techniques and then apply GCN. However, the process of feature filling and graph learning are separated, resulting in degraded and unstable performance. This problem becomes more serious when a large number of features are missing. We propose an approach that adapts GCN to graphs containing missing features. In contrast to traditional strategy, our approach integrates the processing of missing features and graph learning within the same neural network architecture. Our idea is to represent the missing data by Gaussian Mixture Model (GMM) and calculate the expected activation of neurons in the first hidden layer of GCN, while keeping the other layers of the network unchanged. This enables us to learn the GMM parameters and network weight parameters in an end-to-end manner. Notably, our approach does not increase the computational complexity of GCN and it is consistent with GCN when the features are complete. We demonstrate through extensive experiments that our approach significantly outperforms the imputation based methods in node classification and link prediction tasks. We show that the performance of our approach for the case with a low level of missing features is even superior to GCN for the case with complete features. (C) 2020 The Author(s). Published by Elsevier B.V.
Keyword:
Graph convolutional neural network
GCN
Missing data
Incomplete data
Graph embedding
Network representation learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
论文数:
6.8K
被引数:
2.3W

机构

I
Institute of Science Tokyo
学者数:
3.2W
论文数: 2.7W
被引数: 117
T
Tokyo Institute of Technology
学者数:
1.1W
论文数: 9.0K
被引数: 1.9W
引用论文

引用论文

Figurale Nachwirkungen
err1966-01-01
err0
PREAI
errM. K. Malhotra
err分享
err收藏
A prospective study of surgical margin status in oral squamous cell carcinoma: A preliminary report
err2008-12-12
err0
PREAI
errRan Yahalom; Alex Dobriyan; Marilena Vered; Yoav P. Talmi; Shlomo Teicher; Lev Bedrin
err分享
err收藏
Can CD34 discriminate between benign and malignant hepatocytic lesions in fine-needle aspirates and thin core biopsies?
err2000-11-10
err0
errOAAI
errW. Bastiaan de Boer; Amanda Segal; Felicity A. Frost; Gregory F. Sterrett
err分享
err收藏
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err
IF0
err
err0
errOAAI
err
err分享
err收藏
学者 查看更多内容