Deep Learning for Learning Graph Representations
arXiv:2001.00293 · doi:10.1007/978-3-030-31756-0_6
Abstract
Mining graph data has become a popular research topic in computer science and has been widely studied in both academia and industry given the increasing amount of network data in the recent years. However, the huge amount of network data has posed great challenges for efficient analysis. This motivates the advent of graph representation which maps the graph into a low-dimension vector space, keeping original graph structure and supporting graph inference. The investigation on efficient representation of a graph has profound theoretical significance and important realistic meaning, we therefore introduce some basic ideas in graph representation/network embedding as well as some representative models in this chapter.
51 pages, 8 figures
References in corpus (14)
- Adam: A Method for Stochastic Optimization
- Distributed Representations of Words and Phrases and their Compositionality
- DeepWalk: Online Learning of Social Representations
- LINE: Large-scale Information Network Embedding
- Tutorial on Variational Autoencoders
- Vertex similarity in networks
- Fast Computation of Wasserstein Barycenters
- Role Discovery in Networks
- Wasserstein Auto-Encoders
- Word Representations via Gaussian Embedding
- Bregman Alternating Direction Method of Multipliers
- Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
- Structural Deep Embedding for Hyper-Networks
- Learning Wasserstein Embeddings