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

MILE:一个多层次的可伸缩图嵌入框架

MILE: A Multi-Level Framework for Scalable Graph Embedding

Google(谷歌);The Ohio State University(俄亥俄州立大学)

Jiongqian Liang, Saket Gurukar, Srinivasan Parthasarathy

摘要:

最近,人们对设计图嵌入方法的兴趣激增。由于计算复杂性和内存需求,很少(如果有的话)能够扩展到具有数百万个节点的大型图。在本文中,我们放宽了这一限制,通过引入多级嵌入(MILE)框架-一种通用的方法,允许当代图形嵌入方法扩展到大型图形。MILE使用混合匹配技术重复地将图粗化为更小的图,以保持图的骨干结构。然后,它将现有的嵌入方法应用于粗图,并通过它学习的图卷积神经网络将嵌入细化到原始图。所提出的MILE框架是不可知的底层图嵌入技术,可以应用到许多现有的图嵌入方法,而无需修改它们。我们将我们的框架应用于几种流行的图嵌入技术,并对现实世界的图进行嵌入。在五个大规模数据集上的实验结果表明,MILE显著提高了图嵌入的速度(数量级),同时生成更好质量的嵌入,用于节点分类任务。MILE可以轻松地扩展到具有900万个节点和4000万条边的图形,现有方法在现代工作站上运行内存不足或计算时间过长。我们的代码和数据是公开的,并附有添加新的基本嵌入方法的详细说明:\url{https://github.com/jiongqian/MILE}。

英文摘要:

Recently there has been a surge of interest in designing graph embedding methods. Few, if any, can scale to a large-sized graph with millions of nodes due to both computational complexity and memory requirements. In this paper, we relax this limitation by introducing the MultI-Level Embedding (MILE) framework -- a generic methodology allowing contemporary graph embedding methods to scale to large graphs. MILE repeatedly coarsens the graph into smaller ones using a hybrid matching technique to maintain the backbone structure of the graph. It then applies existing embedding methods on the coarsest graph and refines the embeddings to the original graph through a graph convolution neural network that it learns. The proposed MILE framework is agnostic to the underlying graph embedding techniques and can be applied to many existing graph embedding methods without modifying them. We employ our framework on several popular graph embedding techniques and conduct embedding for real-world graphs. Experimental results on five large-scale datasets demonstrate that MILE significantly boosts the speed (order of magnitude) of graph embedding while generating embeddings of better quality, for the task of node classification. MILE can comfortably scale to a graph with 9 million nodes and 40 million edges, on which existing methods run out of memory or take too long to compute on a modern workstation. Our code and data are publicly available with detailed instructions for adding new base embedding methods: \url{https://github.com/jiongqian/MILE}.

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

↑