Network representation learning: A macro and micro view

Abstract

Graph is a universe data structure that is widely used to organize data in real-world. Various real-word networks like the transportation network, social and academic network can be represented by graphs. Recent years have witnessed the quick development on representing vertices in the network into a low-dimensional vector space, referred to as network representation learning. Representation learning can facilitate the design of new algorithms on the graph data. In this survey, we conduct a comprehensive review of current literature on network representation learning. Existing algorithms can be categorized into three groups: shallow embedding models, heterogeneous network embedding models, graph neural network based models. We review state-of-the-art algorithms for each category and discuss the essential differences between these algorithms. One advantage of the survey is that we systematically study the underlying theoretical foundations underlying the different categories of algorithms, which offers deep insights for better understanding the development of the network representation learning field.

arXiv comment22 pages, 10 figures

References in corpus (39)

• Semi-Supervised Classification with Graph Convolutional Networks
• A Simple Framework for Contrastive Learning of Visual Representations
• Neural Architecture Search with Reinforcement Learning
• Neural Message Passing for Quantum Chemistry
• From Frequency to Meaning: Vector Space Models of Semantics
• Link Prediction in Complex Networks: A Survey
• Neural Architecture Search: A Survey
• Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering
• Tutorial on Variational Autoencoders
• Convolutional Neural Networks for Sentence Classification
• Momentum Contrast for Unsupervised Visual Representation Learning
• Adversarial Attacks on Neural Networks for Graph Data
• Variational Graph Auto-Encoders
• Representation Learning for Attributed Multiplex Heterogeneous Network
• FastGCN: Fast Learning with Graph Convolutional Networks via Importance Sampling
• Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning
• Rethinking Pre-training and Self-training
• Attention-based Graph Neural Network for Semi-supervised Learning
• Revisiting Graph Neural Networks: All We Have is Low-Pass Filters
• Graph Convolutional Policy Network for Goal-Directed Molecular Graph Generation
• Single Path One-Shot Neural Architecture Search with Uniform Sampling
• PairNorm: Tackling Oversmoothing in GNNs
• Adaptive Sampling Towards Fast Graph Representation Learning
• Strategies for Pre-training Graph Neural Networks
• GraphGAN: Graph Representation Learning with Generative Adversarial Nets
• Adversarial Attacks on Node Embeddings via Graph Poisoning
• Graph-Bert: Only Attention is Needed for Learning Graph Representations
• Self-supervised Learning on Graphs: Deep Insights and New Direction
• Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological View
• Learning Role-based Graph Embeddings
• Adversarial Network Embedding
• When Does Self-Supervision Help Graph Convolutional Networks?
• Auto-GNN: Neural Architecture Search of Graph Neural Networks
• Batch Virtual Adversarial Training for Graph Convolutional Networks
• Don't Walk, Skip! Online Learning of Multi-scale Network Embeddings
• Heterogeneous Graph Transformer
• Self-supervised Training of Graph Convolutional Networks
• Understanding Negative Sampling in Graph Representation Learning
• Can Graph Neural Networks Help Logic Reasoning?