Deterministic Graph-Walking Program Mining

Abstract

. Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities compris-ing the data. We formalise the notion of connection between two vertex sets in terms of edge and vertex features by introducing graph-walking programs. We give two algorithms for mining of deterministic graph-walking programs that yield programs in the order of increasing length. These programs characterise linear long-distance relationships between the given two vertex sets in the context of the whole graph.