摘要
Graph Convolutional Networks (GCN) and their variants have achieved brilliant results in graph representation learning. However, most existing methods cannot be utilized for deep architectures and can only capture the low order proximity in networks. In this paper, we have proposed a Residual Simple Graph Convolutional Network (RSGCN), which can aggregate information from distant neighbor node features without over-smoothing and vanishing gradients. Given that node features of the same class have certain similarity, a weighted feature propagation is considered to ensure effective information aggregation by giving higher weights to similar neighbor nodes. Experimental results on several datasets of node classification demonstrate the proposed methods outperform the state-of-the-art methods in terms of effectiveness and efficiency.
学科与关键词
- Graph representation learning via simple jumping knowledge networksYang, Fei; Zhang, Huyin*; Tao, Shiming; Hao, ShengApplied Intelligence, 2022, 52(10): 11324-11342.被引 3
- Are Graph Convolutional Networks With Random Weights Feasible?Huang, Changqin; Li, Ming*; Cao, Feilong; Fujita, Hamido; Li, Zhao; Wu, XindongIEEE Transactions on Pattern Analysis and Machine Intelligence, 2023, 45(3): 2751-2768.被引 20
- Graph deconvolutional networksZhang, Chun-Yang; Hu, Junfeng*; Yang, Lin*; Chen, C. L. Philip; Yao, ZhiliangInformation Sciences, 2020, 518: 330-340.被引 12
