An Investigation of Attention Mechanisms in Graph Convolutional Networks Applied to Link Prediction Problems

Public Deposited
Resource Type
Creator
Abstract
  • The link prediction problem is fundamental to many application domains. Recently, deep learning-based models have been proposed to tackle this kind of problem. Graph auto-encoder (GAE) is a framework for unsupervised learning on graph-structured data. GAE achieves competitive results in link prediction tasks on citation networks. Another important problem on graph-structured data is node classification. Graph attention mechanism has been shown to have good performance in these tasks. This research investigates whether graph attention mechanisms can achieve good performance in link prediction tasks. We propose the attentive graph auto-encoder (AGAE) model, which incorporates GAE with the graph attention mechanism. The model is compared with GAE on both real-world citation networks and synthetic datasets. Investigations on how the model performs on networks with different characteristics is also included. In general, AGAE achieves competitive performance with GAE on citation networks while it outperforms GAE on certain synthetic networks.

Subject
Language
Publisher
Thesis Degree Level
Thesis Degree Name
Thesis Degree Discipline
Identifier
Rights Notes
  • Copyright © 2020 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.

Date Created
  • 2020

Relations

In Collection:

Items