Graph embeddings via matrix factorization for link prediction: smoothing or truncating negatives?

by   Asan Agibetov, et al.

Link prediction – the process of uncovering missing links in a complex network – is an important problem in information sciences, with applications ranging from social sciences to molecular biology. Recent advances in neural graph embeddings have proposed an end-to-end way of learning latent vector representations of nodes, with successful application in link prediction tasks. Yet, our understanding of the internal mechanisms of such approaches has been rather limited, and only very recently we have witnessed the development of a very compelling connection to the mature matrix factorization theory. In this work, we make an important contribution to our understanding of the interplay between the skip-gram powered neural graph embedding algorithms and the matrix factorization via SVD. In particular, we show that the link prediction accuracy of graph embeddings strongly depends on the transformations of the original graph co-occurrence matrix that they decompose, sometimes resulting in staggering boosts of accuracy performance on link prediction tasks. Our improved approach to learning low-rank factorization embeddings that incorporate information from unlikely pairs of nodes yields results on par with the state-of-the-art link prediction performance achieved by a complex neural graph embedding model


Generalized Neural Graph Embedding with Matrix Factorization

Recent advances in language modeling such as word2vec motivate a number ...

Kernel Node Embeddings

Learning representations of nodes in a low dimensional space is a crucia...

Causal Lifting and Link Prediction

Current state-of-the-art causal models for link prediction assume an und...

Log-Normal Matrix Completion for Large Scale Link Prediction

The ubiquitous proliferation of online social networks has led to the wi...

Complex Embeddings for Simple Link Prediction

In statistical relational learning, the link prediction problem is key t...

Graph Embeddings at Scale

Graph embedding is a popular algorithmic approach for creating vector re...

Swivel: Improving Embeddings by Noticing What's Missing

We present Submatrix-wise Vector Embedding Learner (Swivel), a method fo...

Please sign up or login with your details

Forgot password? Click here to reset