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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Bipedal Walking Robot using Deep Deterministic Policy Gradient
Machine learning algorithms have found several applications in the field of robotics and control systems. The control systems community has started to show interest towards several machine learning algorithms from the su…
BIG-bench Machine LearningDecision MakingImitation Learningreinforcement-learning+2WalkingTime: Dynamic Graph Embedding Using Temporal-Topological Flows
Increased attention has been paid over the last four years to dynamic network embedding. Existing dynamic embedding methods, however, consider the problem as limited to the evolution of a topology over a sequence of glob…
Dynamic graph embeddingGraph EmbeddingKnowledge GraphsNetwork Embedding+1Computing H-Partitions in ASP and Datalog
A $H$-partition of a finite undirected simple graph $G$ is a labeling of $G$'s vertices such that the constraints expressed by the model graph $H$ are satisfied. For every model graph $H$, it can be decided in non-determ…
NegationMixed Nondeterministic-Probabilistic Automata: Blending graphical probabilistic models with nondeterminism
Graphical models in probability and statistics are a core concept in the area of probabilistic reasoning and probabilistic programming-graphical models include Bayesian networks and factor graphs. In this paper we develo…
Probabilistic ProgrammingRight Model, Right Time: Real-Time Cascaded-Fidelity MPC for Bipedal Walking
This paper presents a multi-phase whole-body model predictive control (MPC) approach for bipedal walking, combining a detailed whole-body model in the near horizon with a simplified single-rigid-body model in the later p…