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

REFINE:用于网络嵌入的随机RangE查找器

REFINE: Random RangE FInder for Network Embedding

Australian National University(澳大利亚国立大学);Data 61/CSIRO(Data61/澳大利亚联邦科学与工业研究组织)

Hao Zhu, Piotr Koniusz

摘要:

网络嵌入方法最近吸引了相当大的兴趣,因为它们学习节点的低维向量表示。基于矩阵分解的嵌入是有效的,但由于特征分解步骤,它们通常是计算昂贵的。在本文中,我们提出了一个随机范围查找器为基础的网络嵌入(REFINE)算法,它可以在一个单一的线程在30秒内执行嵌入100万个节点(YouTube)。REFINE比ProNE快10倍,ProNE比LINE、DeepWalk、Node 2 Vec、GraRep和Hope等其他方法快10- 400倍。首先,我们制定我们的网络嵌入方法作为一个跳跃的gram模型,但与正交约束,我们重新将其转化为矩阵分解问题。我们采用随机块QR分解来快速获得节点表示,而不是像其他方法那样使用随机tSVD(截断SVD)。此外,我们设计了一个简单而有效的频谱滤波器网络增强,以获得高阶信息的节点表示。实验结果表明,REFINE算法在不同规模的数据集(从数千到数百万个节点/边)上都能有效地进行节点分类,同时具有良好的性能。

英文摘要:

Network embedding approaches have recently attracted considerable interest as they learn low-dimensional vector representations of nodes. Embeddings based on the matrix factorization are effective but they are usually computationally expensive due to the eigen-decomposition step. In this paper, we propose a Random RangE FInder based Network Embedding (REFINE) algorithm, which can perform embedding on one million of nodes (YouTube) within 30 seconds in a single thread. REFINE is 10x faster than ProNE, which is 10-400x faster than other methods such as LINE, DeepWalk, Node2Vec, GraRep, and Hope. Firstly, we formulate our network embedding approach as a skip-gram model, but with an orthogonal constraint, and we reformulate it into the matrix factorization problem. Instead of using randomized tSVD (truncated SVD) as other methods, we employ the Randomized Blocked QR decomposition to obtain the node representation fast. Moreover, we design a simple but efficient spectral filter for network enhancement to obtain higher-order information for node representation. Experimental results prove that REFINE is very efficient on datasets of different sizes (from thousand to million of nodes/edges) for node classification, while enjoying a good performance.

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

↑