计算机科学
图形
卷积神经网络
可扩展性
人工智能
编码
边距(机器学习)
理论计算机科学
模式识别(心理学)
机器学习
生物化学
数据库
基因
化学
作者
Thomas Kipf,Max Welling
出处
期刊:Cornell University - arXiv
日期:2016-01-01
被引量:13934
标识
DOI:10.48550/arxiv.1609.02907
摘要
We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs. We motivate the choice of our convolutional architecture via a localized first-order approximation of spectral graph convolutions. Our model scales linearly in the number of graph edges and learns hidden layer representations that encode both local graph structure and features of nodes. In a number of experiments on citation networks and on a knowledge graph dataset we demonstrate that our approach outperforms related methods by a significant margin.
科研通智能强力驱动
Strongly Powered by AbleSci AI