A Neural Turing Machine for Conditional Transition Graph Modeling

by   Mehdi Ben Lazreg, et al.

Graphs are an essential part of many machine learning problems such as analysis of parse trees, social networks, knowledge graphs, transportation systems, and molecular structures. Applying machine learning in these areas typically involves learning the graph structure and the relationship between the nodes of the graph. However, learning the graph structure is often complex, particularly when the graph is cyclic, and the transitions from one node to another are conditioned such as graphs used to represent a finite state machine. To solve this problem, we propose to extend the memory based Neural Turing Machine (NTM) with two novel additions. We allow for transitions between nodes to be influenced by information received from external environments, and we let the NTM learn the context of those transitions. We refer to this extension as the Conditional Neural Turing Machine (CNTM). We show that the CNTM can infer conditional transition graphs by empirically verifiying the model on two data sets: a large set of randomly generated graphs, and a graph modeling the information retrieval process during certain crisis situations. The results show that the CNTM is able to reproduce the paths inside the graph with accuracy ranging from 82,12 65,25


page 1

page 8


Deep Graph Generators

Learning distributions of graphs can be used for automatic drug discover...

Why can big.bi be changed to bi.gbi? A mathematical model of syllabification and articulatory synthesis

A simplified model of articulatory synthesis involving four stages is pr...

Dual Convolutional Neural Network for Graph of Graphs Link Prediction

Graphs are general and powerful data representations which can model com...

On Minimum Connecting Transition Sets in Graphs

A forbidden transition graph is a graph defined together with a set of p...

Node Copying: A Random Graph Model for Effective Graph Sampling

There has been an increased interest in applying machine learning techni...

On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs

This report concerns the information content of a graph, optionally cond...

A First Experiment on Including Text Literals in KGloVe

Graph embedding models produce embedding vectors for entities and relati...

Please sign up or login with your details

Forgot password? Click here to reset