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.
Kernels on Prolog Ground Terms / A. Passerini;P. Frasconi. - STAMPA. - (2005), pp. 1626-1629. (Intervento presentato al convegno INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE nel 2005).
Kernels on Prolog Ground Terms
FRASCONI, PAOLO
2005
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.