pith. sign in

arxiv: 1812.00279 · v1 · pith:RA3UABUFnew · submitted 2018-12-01 · 💻 cs.LG · stat.ML

Interpretable Graph Convolutional Neural Networks for Inference on Noisy Knowledge Graphs

classification 💻 cs.LG stat.ML
keywords graphdatasetknowledgeneuralbiomedicalcleancommonconvolutional
0
0 comments X
read the original abstract

In this work, we provide a new formulation for Graph Convolutional Neural Networks (GCNNs) for link prediction on graph data that addresses common challenges for biomedical knowledge graphs (KGs). We introduce a regularized attention mechanism to GCNNs that not only improves performance on clean datasets, but also favorably accommodates noise in KGs, a pervasive issue in real-world applications. Further, we explore new visualization methods for interpretable modelling and to illustrate how the learned representation can be exploited to automate dataset denoising. The results are demonstrated on a synthetic dataset, the common benchmark dataset FB15k-237, and a large biomedical knowledge graph derived from a combination of noisy and clean data sources. Using these improvements, we visualize a learned model's representation of the disease cystic fibrosis and demonstrate how to interrogate a neural network to show the potential of PPARG as a candidate therapeutic target for rheumatoid arthritis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.