Graph structures, random walks, and all that : learning graphs with jumping knowledge networks
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/1721.1/121660 |
_version_ | 1826218073829408768 |
---|---|
author | Xu, Keyulu. |
author2 | Stefanie Jegelka. |
author_facet | Stefanie Jegelka. Xu, Keyulu. |
author_sort | Xu, Keyulu. |
collection | MIT |
description | This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. |
first_indexed | 2024-09-23T17:13:45Z |
format | Thesis |
id | mit-1721.1/121660 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T17:13:45Z |
publishDate | 2019 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/1216602019-07-24T03:07:57Z Graph structures, random walks, and all that : learning graphs with jumping knowledge networks Learning graphs with jumping knowledge networks Xu, Keyulu. Stefanie Jegelka. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Electrical Engineering and Computer Science. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019 Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 51-54). Graph representation learning aims to extract high-level features from the graph structures and node features, in order to make predictions about the nodes and the graphs. Applications include predicting chemical properties of drugs, community detection in social networks, and modeling interactions in physical systems. Recent deep learning approaches for graph representation learning, namely Graph Neural Networks (GNNs), follow a neighborhood aggregation procedure, where the representation vector of a node is computed by recursively aggregating and transforming feature vectors of its neighboring nodes. We analyze some important properties of these models, and propose a strategy to overcome the limitations. In particular, the range of neighboring nodes that a node's representation draws from strongly depends on the graph structure, analogous to the spread of a random walk. To adapt to local neighborhood properties and tasks, we explore an architecture - jumping knowledge (JK) networks that flexibly leverages, for each node, different neighborhood ranges to enable better structure-aware representation. In a number of experiments on social, bioinformatics and citation networks, we demonstrate that our model achieves state-of-the-art performance. Furthermore, combining the JK framework with models like Graph Convolutional Networks, GraphSAGE and Graph Attention Networks consistently improves those models' performance. by Keyulu Xu. S.M. S.M. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science 2019-07-15T20:31:43Z 2019-07-15T20:31:43Z 2019 2019 Thesis https://hdl.handle.net/1721.1/121660 1102051218 eng MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582 54 pages application/pdf Massachusetts Institute of Technology |
spellingShingle | Electrical Engineering and Computer Science. Xu, Keyulu. Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title | Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title_full | Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title_fullStr | Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title_full_unstemmed | Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title_short | Graph structures, random walks, and all that : learning graphs with jumping knowledge networks |
title_sort | graph structures random walks and all that learning graphs with jumping knowledge networks |
topic | Electrical Engineering and Computer Science. |
url | https://hdl.handle.net/1721.1/121660 |
work_keys_str_mv | AT xukeyulu graphstructuresrandomwalksandallthatlearninggraphswithjumpingknowledgenetworks AT xukeyulu learninggraphswithjumpingknowledgenetworks |