Learning from Interpretations: A Rooted Kernel for Ordered Hypergraphs

The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generalizes previous approache