kLog: a language for logical and relational learning with kernels
From MaRDI portal
(Redirected from Publication:464624)
KLog: a language for logical and relational learning with kernels
KLog: a language for logical and relational learning with kernels
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1651999 (Why is no real title available?)
- scientific article; zbMATH DE number 5296741 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- A parametric filtering algorithm for the graph isomorphism problem
- Convex multi-task feature learning
- Fast learning of relational kernels
- Feature Discovery with Type Extension Trees
- Graph kernels
- Hash kernels for structured data
- Improving Prolog programs: Refactoring for Prolog
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- Kernels for Structured Data
- Large margin methods for structured and interdependent output variables
- Large-scale machine learning with stochastic gradient descent
- Learning multiple tasks with kernel methods
- Learning to construct knowledge bases from the World Wide Web
- Logical and Relational Learning
- Markov logic networks
- On the implementation of the probabilistic logic programming language ProbLog
- Probabilistic graphical models.
- Probabilistic inductive logic programming. Theory and applications
- Relational retrieval using a combination of path-constrained random walks
- Solving the multiple instance problem with axis-parallel rectangles.
- Structured machine learning: the next ten years
- The YAP prolog system
- Top-down induction of first-order logical decision trees
- Transforming graph data for statistical relational learning
- Weisfeiler-Lehman graph kernels
Cited in
(19)- DKL: an efficient algorithm for learning deterministic Kripke structures
- Probabilistic learning on graphs via contextual architectures
- An integrated development environment for probabilistic relational reasoning
- Inclusion of domain-knowledge into GNNs using mode-directed inverse entailment
- Structure learning for relational logistic regression: an ensemble approach
- scientific article; zbMATH DE number 1950769 (Why is no real title available?)
- Kernels on Prolog proof trees: statistical learning in the ILP setting
- kLog
- A gentle introduction to deep learning for graphs
- Modalities, relations, and learning. A relational interpretation of learning approaches
- Learning with Kernels and Logical Representations
- Fast learning of relational kernels
- From statistical relational to neurosymbolic artificial intelligence: a survey
- Learning with Kernels in Description Logics
- An expressive dissimilarity measure for relational clustering using neighbourhood trees
- kProbLog: an algebraic Prolog for machine learning
- Soft quantification in statistical relational learning
- Statistical relational learning with soft quantifiers
- kProbLog: an algebraic Prolog for kernel programming
This page was built for publication: kLog: a language for logical and relational learning with kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464624)
