Graph representation learning

by Hamilton, William L., (William Leif)

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Graph representation learning / William L. Hamilton.

Summary

Graph-structured data is ubiquitous throughout the natural and social sciences, from telecommunication networks to quantum chemistry. Building relational inductive biases into deep learning architectures is crucial for creating systems that can learn, reason, and generalize from this kind of data. Recent years have seen a surge in research on graph representation learning, including techniques for deep graph embeddings, generalizations of convolutional neural networks to graph-structured data, and neural message-passing approaches inspired by belief propagation. These advances in graph representation learning have led to new state-of-the-art results in numerous domains, including chemical synthesis, 3D vision, recommender systems, question answering, and social network analysis. This book provides a synthesis and overview of graph representation learning. It begins with a discussion of the goals of graph representation learning as well as key methodological foundations in graph theory and network analysis. Following this, the book introduces and reviews methods for learning node embeddings, including random-walk-based methods and applications to knowledge graphs. It then provides a technical synthesis and introduction to the highly successful graph neural network (GNN) formalism, which has become a dominant and fast-growing paradigm for deep learning with graph data. The book concludes with a synthesis of recent advancements in deep generative models for graphs--a nascent but quickly growing subset of graph representation learning.

Edition Statements

Publication Date:©2020

Publication Statements

Publisher(s):Springer
Place of Publication:Cham, Switzerland
Language:eng
Publication Date:©2020

The Physical Object

Description:1 online resource (xvii, 141 pages) : : illustrations

Edition Identifiers

ISBN:9781681739649, 168173964X, 9783031015885, 3031015886
DOI:10.1007/978-3-031-01588-5
oclc:on1197843412
LC Classification:Q325.5
Dewey Decimal:006.3/1

1. Introduction -- 1.1. What is a graph? -- 1.2. Machine learning on graphs

2. Background and traditional approaches -- 2.1. Graph statistics and kernel methods -- 2.2. Neighborhood overlap detection -- 2.3. Graph Laplacians and spectral methods -- 2.4. Toward learned representations

Part I. Node embeddings. 3. Neighborhood reconstruction methods -- 3.1. An encoder-decoder perspective -- 3.2. Factorization-based approaches -- 3.3. Random walk embeddings -- 3.4. Limitations of shallow embeddings

4. Multi-relational data and knowledge graphs -- 4.1. Reconstructing multi-relational data -- 4.2. Loss functions -- 4.3. Multi-relational decoders

Part II. Graph neural networks. 5. The graph neural network model -- 5.1. Neural message passing -- 5.2. Generalized neighborhood aggregation -- 5.3. Generalized update methods -- 5.4. Edge features and multi-relational GNNs -- 5.5. Graph pooling -- 5.6. Generalized message passing

6. Graph neural networks in practice -- 6.1. Applications and loss functions -- 6.2. Efficiency concerns and node sampling -- 6.3. Parameter sharing and regularization

7. Theoretical motivations -- 7.1. Gnns and graph convolutions -- 7.2. Gnns and probabilistic …

Subjects