著者

立花 誠人 村田 剛志

出版者

一般社団法人 人工知能学会

雑誌

人工知能学会論文誌 (ISSN:13460714)

巻号頁・発行日

vol.34, no.5, pp.B-IC2_1-8, 2019-09-01 (Released:2019-09-01)

参考文献数

14

被引用文献数

1

---

Since several types of data can be represented as graphs, there has been a demand for generalizing neural network models for graph data. Graph convolution is a recent scalable method for performing deep feature learning on attributed graphs by aggregating local node information over multiple layers. Such layers only consider attribute information of node neighbors in the forward model and do not incorporate knowledge of global network structure in the learning task. In this paper, we present a scalable semi-supervised learning method for graph-structured data which considers not only neighbors information, but also the global network structure. In our method, we add a term preserving the network structural features such as centrality to the objective function of Graph Convolutional Network and train for both node classification and network structure preservation simultaneously. Experimental results showed that our method outperforms state-of-the-art baselines for the node classification tasks in the sparse label regime.