Constructing Graph Node Embeddings via Discrimination of Similarity Distributions

Stanislav Tsepa, Maxim Panov

The problem of unsupervised learning node embeddings in graphs is one of the important directions in modern network science. In this work we propose a novel framework, which is aim…