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

利用图度量嵌入构造快速图算法

Making Fast Graph-based Algorithms with Graph Metric Embeddings

University of Oslo(奥斯陆大学);Universität Hamburg(汉堡大学);Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究院)

Andrey Kutuzov, Mohammad Dorgham, Oleksiy Oliynyk, Chris Biemann, Alexander Panchenko

摘要:

图中节点之间的距离度量的计算是低效的,并且不能扩展到大型图。我们探索密集向量表示作为近似相同信息的有效方法:我们介绍了一种简单而高效的学习图嵌入的方法。我们的方法不是直接在图结构上操作,而是考虑成对节点相似性的结构度量,并学习反映用户定义的图距离度量的密集节点表示,例如最短路径距离或考虑图结构之外的信息的距离度量。我们展示了几个数量级的速度时,预测词的相似性向量运算对我们的嵌入,而不是直接计算各自的基于路径的措施,同时优于其他各种图形嵌入语义相似性和词义消歧任务,并显示评价的WordNet图和两个知识库图。

英文摘要:

The computation of distance measures between nodes in graphs is inefficient and does not scale to large graphs. We explore dense vector representations as an effective way to approximate the same information: we introduce a simple yet efficient and effective approach for learning graph embeddings. Instead of directly operating on the graph structure, our method takes structural measures of pairwise node similarities into account and learns dense node representations reflecting user-defined graph distance measures, such as e.g.the shortest path distance or distance measures that take information beyond the graph structure into account. We demonstrate a speed-up of several orders of magnitude when predicting word similarity by vector operations on our embeddings as opposed to directly computing the respective path-based measures, while outperforming various other graph embeddings on semantic similarity and word sense disambiguation tasks and show evaluations on the WordNet graph and two knowledge base graphs.

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

↑