A Complex Network based Graph Embedding Method for Link Prediction
Graph embedding methods aim at finding useful graph representations by mapping nodes to a low-dimensional vector space. It is a task with important downstream applications, such as link prediction, graph reconstruction, data visualization, node classification, and language modeling. In recent years, the field of graph embedding has witnessed a shift from linear algebraic approaches towards local, gradient-based optimization methods combined with random walks and deep neural networks to tackle the problem of embedding large graphs. However, despite this improvement in the optimization tools, graph embedding methods are still generically designed in a way that is oblivious to the particularities of real-life networks. Indeed, there has been significant progress in understanding and modeling complex real-life networks in recent years. However, the obtained results have had a minor influence on the development of graph embedding algorithms. This paper aims to remedy this by designing a graph embedding method that takes advantage of recent valuable insights from the field of network science. More precisely, we present a novel graph embedding approach based on the popularity-similarity and local attraction paradigms. We evaluate the performance of the proposed approach on the link prediction task on a large number of real-life networks. We show, using extensive experimental analysis, that the proposed method outperforms state-of-the-art graph embedding algorithms. We also demonstrate its robustness to data scarcity and the choice of embedding dimensionality.
Code (0)
등록된 구현이 없습니다.
Tasks
Data VisualizationGraph EmbeddingGraph ReconstructionLanguage ModelingLanguage ModellingLink PredictionNode ClassificationSimilar Papers 제목 키워드 기반
On the Equivalence of Holographic and Complex Embeddings for Link Prediction
We show the equivalence of two state-of-the-art link prediction/knowledge graph completion methods: Nickel et al's holographic embedding and Trouillon et al.'s complex embedding. We first consider a spectral version of t…
Knowledge Graph CompletionLink PredictionAn Open-World Extension to Knowledge Graph Completion Models
We present a novel extension to embedding-based knowledge graph completion models which enables them to perform open-world link prediction, i.e. to predict facts for entities unseen in training based on their textual des…
Knowledge Graph CompletionLink PredictionPredictionWord EmbeddingsSimplE Embedding for Link Prediction in Knowledge Graphs
Knowledge graphs contain knowledge about the world and provide a structured representation of this knowledge. Current knowledge graphs contain only a small subset of what is true in the world. Link prediction approaches …
Knowledge GraphsLink PredictionPredictionComplex Embeddings for Simple Link Prediction
In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factoriza…
Link PredictionPredictionRelational ReasoningConvolutional Hypercomplex Embeddings for Link Prediction
Knowledge graph embedding research has mainly focused on the two smallest normed division algebras, $\mathbb{R}$ and $\mathbb{C}$. Recent results suggest that trilinear products of quaternion-valued embeddings can be a m…
Graph EmbeddingKnowledge Graph EmbeddingLink PredictionPrediction