Feature recommendation strategy for graph convolutional network

Abstract

Graph Convolutional Network (GCN) is a new method for extracting, learning, and inferencing graph data that builds an embedded representation of the target node by aggregating information from neighbouring nodes. GCN is decisive for node classification and link prediction tasks in recent research. Although the existing GCN performs well, we argue that the current design ignores the potential features of the node. In addition, the presence of features with low correlation to nodes can likewise limit the learning ability of the model. Due to the above two problems, we propose Feature Recommendation Strategy (FRS) for Graph Convolutional Network in this paper. The core of FRS is to employ a principled approach to capture both node-to-node and node-to-feature relationships for encoding, then recommending the maximum possible features of nodes and replacing low-correlation features, and finally using GCN for learning of features. We perform a node clustering task on three citation network datasets and experimentally demonstrate that FRS can improve learning on challenging tasks relative to state-of-the-art (SOTA) baselines.

Keywords:

• Feature recommendation strategy
• graph convolutional network
• GCN

Disclosure statement

No potential conflict of interest was reported by the author(s).

Notes

1 In this paper, low-correlation and low-weight mean the same thing, and we use them mixed.

2 https://pytorch.org

3 https://github.com/tkipf/pygcn

4 https://github.com/xdxuyang/SelfSAGCN

Additional information

Funding

This work was supported by the Postgraduate Research & Practice Innovation Program of Jiangsu Province (KYCX21_0408).