论文标题
确定性的图形步行程序挖掘
Deterministic Graph-Walking Program Mining
论文作者
论文摘要
由于它们的多功能性，图形结构允许包含数据的单独实体之间的复杂关系表示。我们通过引入图形步行程序来形式化两个顶点集之间的连接概念。我们提供了两种算法，用于挖掘确定的图形步行程序，以增加长度的顺序产生程序。这些程序表征了整个图的上下文中给定的两个顶点集之间的线性长距离关系。
Owing to their versatility, graph structures admit representations of intricate relationships between the separate entities comprising 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.
