kLog: A Language for Logical and Relational Learning with Kernels
Preprint
Abstract
We introduce kLog, a novel approach to statistical relational learning. Unlike standard approaches, kLog does not represent a probability distribution directly. It is rather a language to perform kernel-based learning on expressive logical and relational representations. kLog allows users to specify learning problems declaratively. It builds on simple but powerful concepts: learning from interpretations, entity/relationship data modeling, logic programming, and deductive databases. Access by the kernel to the rich representation is mediated by a technique we call graphicalization: the relational representation is first transformed into a graph --- in particular, a grounded entity/relationship diagram. Subsequently, a choice of graph kernel defines the feature space. kLog supports mixed numerical and symbolic data, as well as background knowledge in the form of Prolog or Datalog programs as in inductive logic programming systems. The kLog framework can be applied to tackle the same range of tasks that has made statistical relational learning so popular, including classification, regression, multitask learning, and collective classification. We also report about empirical comparisons, showing that kLog can be either more accurate, or much faster at the same level of accuracy, than Tilde and Alchemy. kLog is GPLv3 licensed and is available at http://klog.dinfo.unifi.it along with tutorials.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Practical graph isomorphism, IIJournal of Symbolic Computation, 2014
- Relational retrieval using a combination of path-constrained random walksMachine Learning, 2010
- Fast learning of relational kernelsMachine Learning, 2010
- Structured machine learning: the next ten yearsMachine Learning, 2008
- A parametric filtering algorithm for the graph isomorphism problemConstraints, 2008
- Convex multi-task feature learningMachine Learning, 2008
- Graph kernels for chemical informaticsNeural Networks, 2005
- Inverse entailment and progolNew Generation Computing, 1995
- Applications of stochastic context-free grammars using the Inside-Outside algorithmComputer Speech & Language, 1991
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982