Route kernels for trees

Fabio Aiolli, Giovanni Martino, Alessandro Sperduti

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Almost all tree kernels proposed in the literature match substructures without taking into account their relative positioning with respect to one another. In this paper, we propose a novel family of kernels which explicitly focus on this type of information. Specifically, after defining a family of tree kernels based on routes between nodes, we present an efficient implementation for a member of this family. Experimental results on four different datasets show that our method is able to reach state of the art performances, obtaining in some cases performances better than computationally more demanding tree kernels.

Original languageEnglish
Title of host publicationACM International Conference Proceeding Series
Volume382
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event26th Annual International Conference on Machine Learning, ICML'09 - Montreal, QC
Duration: 14 Jun 200918 Jun 2009

Other

Other26th Annual International Conference on Machine Learning, ICML'09
CityMontreal, QC
Period14/6/0918/6/09

ASJC Scopus subject areas

  • Human-Computer Interaction

Cite this

Aiolli, F., Martino, G., & Sperduti, A. (2009). Route kernels for trees. In ACM International Conference Proceeding Series (Vol. 382). [3] https://doi.org/10.1145/1553374.1553377