快速变形图嵌入:统一框架和一键算法
Fast, Warped Graph Embedding: Unifying Framework and One-Click Algorithm
摘要:
用几个数字来描述社交网络中的用户的最佳方式是什么?从数学上讲,这相当于为图中的每个节点分配一个向量表示,这个过程称为图嵌入。我们提出了一个新的框架,GEM-D,统一了过去的大多数算法,如LapEigs,DeepWalk和node 2 vec。GEM-D通过将任何图嵌入算法分解为三个构建块来实现其目标:节点邻近函数、扭曲函数和损失函数。基于对GEM-D的深入分析,我们提出了一种新的算法,称为UltimateWalk,它的性能优于最近提出的最先进的DeepWalk和node 2 vec。本文的主要贡献在于:(1)提出的框架GEM-D统一了以往的图嵌入算法,为图嵌入的设计提供了一个通用的方法:(2)翘曲函数的非线性对嵌入质量有重要影响,指数函数是经验最优的;(3)本文提出的算法UltimateWalk是一种一键(无需用户自定义参数)、可扩展的、具有封闭形式的解决方案。
英文摘要:
What is the best way to describe a user in a social network with just a few numbers? Mathematically, this is equivalent to assigning a vector representation to each node in a graph, a process called graph embedding. We propose a novel framework, GEM-D that unifies most of the past algorithms such as LapEigs, DeepWalk and node2vec. GEM-D achieves its goal by decomposing any graph embedding algorithm into three building blocks: node proximity function, warping function and loss function. Based on thorough analysis of GEM-D, we propose a novel algorithm, called UltimateWalk, which outperforms the most-recently proposed state-of-the-art DeepWalk and node2vec. The contributions of this work are: (1) The proposed framework, GEM-D unifies the past graph embedding algorithms and provides a general recipe of how to design a graph embedding; (2) the nonlinearlity in the warping function contributes significantly to the quality of embedding and the exponential function is empirically optimal; (3) the proposed algorithm, UltimateWalk is one-click (no user-defined parameters), scalable and has a closed-form solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。