To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
kProbLog: An Algebraic Prolog for Kernel Programming
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium; Department of Information Engineering, Universitá degli Studi di Firenze, Firenze, Italy.
Department of Information Engineering, Universitá degli Studi di Firenze, Firenze, Italy.
Department of Computer Science, Katholieke Universiteit Leuven, Leuven, Belgium.ORCID iD: 0000-0002-6860-6303
2016 (English)In: Inductive Logic Programming: 25th International Conference, ILP 2015, Kyoto, Japan, August 20-22, 2015, Revised Selected Papers / [ed] Katsumi Inoue, Hayato Ohwada, Akihiro Yamamoto, Springer, 2016, Vol. 9575, p. 152-165Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2016. Vol. 9575, p. 152-165
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 9575
Keywords [en]
Graph kernels, Prolog, Machine learning
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:oru:diva-91693DOI: 10.1007/978-3-319-40566-7_11ISI: 000386325200011Scopus ID: 2-s2.0-84977588555ISBN: 978-3-319-40565-0 (print)ISBN: 978-3-319-40566-7 (electronic)OAI: oai:DiVA.org:oru-91693DiVA, id: diva2:1553129
Conference
25th International Conference on Inductive Logic Programming (ILP 2015), Kyoto, Japan, August 20-22, 2015
Available from: 2021-05-07 Created: 2021-05-07 Last updated: 2021-05-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 23 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf