KProbLog: An algebraic prolog for kernel programming

1Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

kProbLog is a simple algebraic extension of Prolog with facts and rules annotated with semiring labels. We propose kProbLog as a language for learning with kernels. kProbLog allows to elegantly specify systems of algebraic expressions on databases. We propose some code examples of gradually increasing complexity, we give a declarative specification of some matrix operations and an algorithm to solve linear systems. Finally we show the encodings of state-of-the-art graph kernels such as Weisfeiler-Lehman graph kernels, propagation kernels and an instance of Graph Invariant Kernels (GIKs), a recent framework for graph kernels with continuous attributes. The number of feature extraction schemas, that we can compactly specify in kProbLog, shows its potential for machine learning applications.

Author supplied keywords

Cite

CITATION STYLE

APA

Orsini, F., Frasconi, P., & De Raedt, L. (2016). KProbLog: An algebraic prolog for kernel programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9575, pp. 152–165). Springer Verlag. https://doi.org/10.1007/978-3-319-40566-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free