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

有向图的节点表示学习

Node Representation Learning for Directed Graphs

Megha Khosla, Jurek Leonhardt, Wolfgang Nejdl, Avishek Anand

摘要:

我们提出了一种新的方法来学习节点表示有向图,它保持单独的视图或嵌入空间的两个不同的节点角色引起的方向性的边缘。我们认为,以前的方法要么未能编码的边缘方向性或他们的编码不能概括跨任务。我们简单的\emph{alternating random walk}策略,我们产生的角色特定的顶点邻域和训练节点嵌入在其相应的源/目标角色,同时充分利用有向图的语义。我们还挖掘了有向图评价的局限性,并提出了一个明确的策略,用于评价有向图中的链接预测和图重构。我们进行了广泛的实验,以展示我们的有效性在几个现实世界的数据集上的链接预测,节点分类和图形重建任务。我们表明,我们的方法的嵌入确实是强大的,可推广的,以及在多种任务和图形的表现。我们表明,我们始终优于所有基线的节点分类任务。除了提供我们的方法的理论解释,我们还表明,我们是相当强大的比其他有向图的方法。

英文摘要:

We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue that the previous approaches either fail to encode the edge directionality or their encodings cannot be generalized across tasks. With our simple \emph{alternating random walk} strategy, we generate role specific vertex neighborhoods and train node embeddings in their corresponding source/target roles while fully exploiting the semantics of directed graphs. We also unearth the limitations of evaluations on directed graphs in previous works and propose a clear strategy for evaluating link prediction and graph reconstruction in directed graphs. We conduct extensive experiments to showcase our effectiveness on several real-world datasets on link prediction, node classification and graph reconstruction tasks. We show that the embeddings from our approach are indeed robust, generalizable and well performing across multiple kinds of tasks and graphs. We show that we consistently outperform all baselines for node classification task. In addition to providing a theoretical interpretation of our method we also show that we are considerably more robust than the other directed graph approaches.

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

↑