第127回計算科学コロキウムを、8月19日（月）に開催いたします。多数のご来聴をお待ちしております。

場所　　　　：筑波大学　計算科学研究センター　ワークショップ室
日時　　　　：2019年8月19日（月）14:00 – 15:00

講演タイトル：VERSE: Versatile Graph Embeddings from Similarity Measures (WWW’18)

講演者氏名　：Panagiotis Karras 准教授（デンマーク オーフス大）   

使用言語　　：英語

Abstract:
Embedding a web-scale information network into a low-dimensional vector space facilitates tasks such as link prediction, classification, and visualization. Past research has addressed the problem of extracting such embeddings by adopting methods from words to graphs, without defining a clearly comprehensible graph-related objective. Yet, as we show, the objectives used in past works implicitly utilize similarity measures among graph nodes. In this paper, we carry the similarity orientation of previous works to its logical conclusion; we propose VERtex Similarity Embeddings (VERSE), a simple, versatile, and memory-efficient method that derives graph embeddings explicitly calibrated to preserve the distributions of a selected vertex-to-vertex similarity measure. VERSE learns such embeddings by training a single-layer neural network. While its default, scalable version does so via sampling similarity information, we also develop a variant using the full information per vertex. Our experimental study on standard benchmarks and real-world datasets demonstrates that VERSE, instantiated with diverse similarity measures, outperforms state-of-the-art methods in terms of precision and recall in major data mining tasks and supersedes them in time and space efficiency, while the scalable sampling-based variant achieves equally good result as the non-scalable  full variant.

世話人：天笠俊之