Kernels on prolog ground terms

Authors:
Andrea Passerini;Paolo Frasconi
Affiliations:
Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze;Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 5
Cited 3

Application of Cascade Correlation Networks for Structures toChemistry

Applied Intelligence
Probabilistic logic learning

ACM SIGKDD Explorations Newsletter
A survey of kernels for structured data

ACM SIGKDD Explorations Newsletter
Kernel Methods for Pattern Analysis

Kernel Methods for Pattern Analysis
Kernels and Distances for Structured Data

Machine Learning

Neural network for graphs: a contextual constructive approach

IEEE Transactions on Neural Networks
Learning with kernels and logical representations

ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Learning with kernels and logical representations

Probabilistic inductive logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a family of kernels over untyped and typed Prolog ground terms and show that they can be applied for learning in structured domains, presenting experimental results in a QSPR task.