Graph Representation Learning and Its Applications: A Survey

Graphs are data structures that effectively represent relational data in the real world. Graph representation learning is a significant task since it could facilitate various downstream tasks, such as node classification, link prediction, etc. Graph representation learning aims to map graph entities to low-dimensional vectors while preserving graph structure and entity relationships. Over the decades, many models have been proposed for graph representation learning. This paper aims to show a comprehensive picture of graph representation learning models, including traditional and state-of-the-art models on various graphs in different geometric spaces. First, we begin with five types of graph embedding models: graph kernels, matrix factorization models, shallow models, deep-learning models, and non-Euclidean models. In addition, we also discuss graph transformer models and Gaussian embedding models. Second, we present practical applications of graph embedding models, from constructing graphs for specific domains to applying models to solve tasks. Finally, we discuss challenges for existing models and future research directions in detail. As a result, this paper provides a structured overview of the diversity of graph embedding models.

Automated summary

Graphs are effective data structures for representing relational data. Graph representation learning is important for various downstream tasks. It aims to map graph entities to low-dimensional vectors while preserving graph structure and relationships. This paper provides a comprehensive overview of graph representation learning models, including traditional and state-of-the-art models on different graphs. It discusses various types of embedding models, practical applications, and challenges for existing models and future research directions.