kLog: a language for logical and relational learning with kernels
type: Item
instance of: scholarly article
title: kLog: a language for logical and relational learning with kernels
zbMATH Open document ID: 1405.68288
author: Paolo Frasconi
author: Fabrizio Costa
author: Luc De Raedt
author: Kurt De Grave
published in: Artificial Intelligence
publication date: 2014-10-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1205.3981
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 6362038
zbMATH Keywords: logical and relational learning
zbMATH Keywords: statistical relational learning
zbMATH Keywords: kernel methods
zbMATH Keywords: Prolog
zbMATH Keywords: deductive databases
describes a project that uses: LIBSVM
describes a project that uses: gSpan
describes a project that uses: ProbLog
describes a project that uses: FACTORIE
describes a project that uses: YAP-Prolog
describes a project that uses: Aleph
MaRDI profile type: Publication
OpenAlex ID: W2114190652
Wikidata QID: Q57931578
arXiv ID: 1205.3981
cites work: Structured machine learning: the next ten years
cites work: Probabilistic inductive logic programming. Theory and applications
cites work: Q3510469
cites work: Fast learning of relational kernels
cites work: Markov logic networks
cites work: Logical and Relational Learning
cites work: Q3093306
cites work: Improving Prolog programs: Refactoring for Prolog
cites work: Convex multi-task feature learning
cites work: The YAP prolog system
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Q3093270
cites work: Learning to construct knowledge bases from the World Wide Web
cites work: Feature Discovery with Type Extension Trees
cites work: Solving the multiple instance problem with axis-parallel rectangles.
cites work: Q3655273
cites work: Kernels for Structured Data
cites work: Graph kernels
cites work: Q5396694
cites work: Q3671211
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: A parametric filtering algorithm for the graph isomorphism problem
cites work: Top-down induction of first-order logical decision trees
cites work: Q2743233
cites work: Transforming Graph Data for Statistical Relational Learning
cites work: Relational retrieval using a combination of path-constrained random walks
cites work: On the implementation of the probabilistic logic programming language ProbLog
cites work: Hash kernels for structured data
DOI: 10.1016/J.ARTINT.2014.08.003
description: scientific article; zbMATH DE number 6362038