页面排名
计算机科学
图形
人工神经网络
节点(物理)
机器学习
卷积神经网络
消息传递
方案(数学)
人工智能
构造(python库)
简单(哲学)
理论计算机科学
数据挖掘
数学
分布式计算
数学分析
哲学
工程类
程序设计语言
认识论
结构工程
作者
Johannes Gasteiger,Aleksandar Bojchevski,Stephan Günnemann
标识
DOI:10.48550/arxiv.1810.05997
摘要
Neural message passing algorithms for semi-supervised classification on graphs have recently achieved great success. However, for classifying a node these methods only consider nodes that are a few propagation steps away and the size of this utilized neighborhood is hard to extend. In this paper, we use the relationship between graph convolutional networks (GCN) and PageRank to derive an improved propagation scheme based on personalized PageRank. We utilize this propagation procedure to construct a simple model, personalized propagation of neural predictions (PPNP), and its fast approximation, APPNP. Our model's training time is on par or faster and its number of parameters on par or lower than previous models. It leverages a large, adjustable neighborhood for classification and can be easily combined with any neural network. We show that this model outperforms several recently proposed methods for semi-supervised classification in the most thorough study done so far for GCN-like models. Our implementation is available online.
科研通智能强力驱动
Strongly Powered by AbleSci AI