网络嵌入:压缩与学习
Network Embedding: on Compression and Learning
摘要:
近年来,将图的结构信息编码到向量空间中的网络嵌入在网络分析中变得流行。虽然最近的方法显示出良好的性能,为各种应用程序,巨大的尺寸的图可能会阻碍现有的网络嵌入方法直接应用于他们。本文提出了一种新的有效的网络嵌入方法NECL。1)是否存在理想的网络压缩?2)网络的压缩是否会显著提高网络的表示学习?对于第一个问题,我们提出了一种基于邻域相似性的图压缩方法,该方法对输入图进行压缩以得到更小的图,而不会丢失关于图的全局结构和图中顶点的局部邻近性的任何/很多信息。对于第二个问题,我们用压缩图代替原来的大图进行网络嵌入,以降低嵌入代价。NECL是一种通用的元策略,可以提高所有基于随机游走的最先进的图嵌入算法的效率,包括DeepWalk和Node 2 vec,而不会失去它们的有效性。在大型真实网络上进行的大量实验验证了NECL方法的效率,平均提高了23 - 57%的嵌入时间,包括行走和学习时间,而不会降低分类准确性,如DBLP,BlogCatalog,Cora和Wiki等真实图形上的单标签和多标签分类任务。
英文摘要:
Recently, network embedding that encodes structural information of graphs into a vector space has become popular for network analysis. Although recent methods show promising performance for various applications, the huge sizes of graphs may hinder a direct application of existing network embedding method to them. This paper presents NECL, a novel efficient Network Embedding method with two goals. 1) Is there an ideal Compression of a network? 2) Will the compression of a network significantly boost the representation Learning of the network? For the first problem, we propose a neighborhood similarity based graph compression method that compresses the input graph to get a smaller graph without losing any/much information about the global structure of the graph and the local proximity of the vertices in the graph. For the second problem, we use the compressed graph for network embedding instead of the original large graph to bring down the embedding cost. NECL is a general meta-strategy to improve the efficiency of all of the state-of-the-art graph embedding algorithms based on random walks, including DeepWalk and Node2vec, without losing their effectiveness. Extensive experiments on large real-world networks validate the efficiency of NECL method that yields an average improvement of 23 - 57% embedding time, including walking and learning time without decreasing classification accuracy as evaluated on single and multi-label classification tasks on real-world graphs such as DBLP, BlogCatalog, Cora and Wiki.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。