论文标题

与图神经网络的节点和边缘的共插入

Co-embedding of Nodes and Edges with Graph Neural Networks

论文作者

Jiang, Xiaodong, Zhu, Ronghang, Ji, Pengsheng, Li, Sheng

论文摘要

作为重要的数据表示,图在许多现实世界应用中无处不在,从社交网络分析到生物学。如何正确有效地学习和从图中提取信息对于大量机器学习任务至关重要。图形嵌入是一种在高维和非欧国人特征空间中转换和编码数据结构为低维和结构空间的方法,其他机器学习算法很容易利用。从统计方法到最近的深度学习方法,例如图形卷积网络(GCN),我们目睹了这种嵌入方法的巨大激增。深度学习方法通​​常通过构建端到端学习框架来直接优化损失功能,通常在大多数图形学习基准中优于传统方法。但是,大多数现有的GCN方法只能使用节点功能执行卷积操作,同时忽略边缘功能中的方便信息,例如知识图中的关系。为了解决这个问题,我们提出了通过边缘节点开关图神经网络的人口稠密,卷积,以学习具有节点和边缘功能的图形结构数据中的任务。人口稠密是一个通用图形嵌入框架,将节点和边缘嵌入到潜在的特征空间中。通过使用原始无向图的线图,切换了节点和边缘的作用,并提出了两个新颖的图形卷积操作以进行特征传播。现实世界中的学术引用网络和量子化学图的实验结果表明,我们的方法在四个图形学习任务中实现或匹配了最先进的性能,包括半监督节点分类,多任务图形分类,图形回归和链接预测。

Graph, as an important data representation, is ubiquitous in many real world applications ranging from social network analysis to biology. How to correctly and effectively learn and extract information from graph is essential for a large number of machine learning tasks. Graph embedding is a way to transform and encode the data structure in high dimensional and non-Euclidean feature space to a low dimensional and structural space, which is easily exploited by other machine learning algorithms. We have witnessed a huge surge of such embedding methods, from statistical approaches to recent deep learning methods such as the graph convolutional networks (GCN). Deep learning approaches usually outperform the traditional methods in most graph learning benchmarks by building an end-to-end learning framework to optimize the loss function directly. However, most of the existing GCN methods can only perform convolution operations with node features, while ignoring the handy information in edge features, such as relations in knowledge graphs. To address this problem, we present CensNet, Convolution with Edge-Node Switching graph neural network, for learning tasks in graph-structured data with both node and edge features. CensNet is a general graph embedding framework, which embeds both nodes and edges to a latent feature space. By using line graph of the original undirected graph, the role of nodes and edges are switched, and two novel graph convolution operations are proposed for feature propagation. Experimental results on real-world academic citation networks and quantum chemistry graphs show that our approach achieves or matches the state-of-the-art performance in four graph learning tasks, including semi-supervised node classification, multi-task graph classification, graph regression, and link prediction.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源