arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1708.04357cs.LGcs.AIstat.ML
收藏

基于虚拟节点的深度学习的图分类

Graph Classification via Deep Learning with Virtual Nodes

Deakin University(迪肯大学);University of Wollongong(伍伦贡大学)

Trang Pham, Truyen Tran, Hoa Dam, Svetha Venkatesh

摘要:

图分类的学习表示将可变大小的图转换为固定大小的向量(或矩阵)。这样的表示很好地与代数操作一起工作。在这里,我们介绍了一个简单的方法来增加一个属性图与一个虚拟节点,是双向连接到所有现有的节点。虚拟节点表示图的潜在方面,这些方面不能立即从属性和局部连接结构中获得。然后将扩展的图通过任何节点表示方法。虚拟节点的表示就是整个图的表示。在本文中,我们使用最近推出的列网络的扩展图,从而在一个新的端到端的图分类模型称为虚拟列网络(VCN)。该模型通过两项任务进行验证:(i)预测化合物的生物活性,以及(ii)从源代码中发现软件漏洞。结果表明,VCN是有竞争力的对成熟的竞争对手。

英文摘要:

Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed graph with a virtual node that is bidirectionally connected to all existing nodes. The virtual node represents the latent aspects of the graph, which are not immediately available from the attributes and local connectivity structures. The expanded graph is then put through any node representation method. The representation of the virtual node is then the representation of the entire graph. In this paper, we use the recently introduced Column Network for the expanded graph, resulting in a new end-to-end graph classification model dubbed Virtual Column Network (VCN). The model is validated on two tasks: (i) predicting bio-activity of chemical compounds, and (ii) finding software vulnerability from source code. Results demonstrate that VCN is competitive against well-established rivals.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑