Route kernels for trees

Fabio Aiolli, Giovanni Martino, Alessandro Sperduti

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

18 Citations (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 publicationProceedings of the 26th International Conference On Machine Learning, ICML 2009
Pages17-24
Number of pages8
Publication statusPublished - 2009
Externally publishedYes
Event26th International Conference On Machine Learning, ICML 2009 - Montreal, QC
Duration: 14 Jun 200918 Jun 2009

Other

Other26th International Conference On Machine Learning, ICML 2009
CityMontreal, QC
Period14/6/0918/6/09

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Software

Cite this

Aiolli, F., Martino, G., & Sperduti, A. (2009). Route kernels for trees. In Proceedings of the 26th International Conference On Machine Learning, ICML 2009 (pp. 17-24)

Route kernels for trees. / Aiolli, Fabio; Martino, Giovanni; Sperduti, Alessandro.

Proceedings of the 26th International Conference On Machine Learning, ICML 2009. 2009. p. 17-24.

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

Aiolli, F, Martino, G & Sperduti, A 2009, Route kernels for trees. in Proceedings of the 26th International Conference On Machine Learning, ICML 2009. pp. 17-24, 26th International Conference On Machine Learning, ICML 2009, Montreal, QC, 14/6/09.
Aiolli F, Martino G, Sperduti A. Route kernels for trees. In Proceedings of the 26th International Conference On Machine Learning, ICML 2009. 2009. p. 17-24
Aiolli, Fabio ; Martino, Giovanni ; Sperduti, Alessandro. / Route kernels for trees. Proceedings of the 26th International Conference On Machine Learning, ICML 2009. 2009. pp. 17-24
@inproceedings{87cfb3717c9b49b0a3a4bdb41433b044,
title = "Route kernels for trees",
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.",
author = "Fabio Aiolli and Giovanni Martino and Alessandro Sperduti",
year = "2009",
language = "English",
isbn = "9781605585161",
pages = "17--24",
booktitle = "Proceedings of the 26th International Conference On Machine Learning, ICML 2009",

}

TY - GEN

T1 - Route kernels for trees

AU - Aiolli, Fabio

AU - Martino, Giovanni

AU - Sperduti, Alessandro

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71149120752&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71149120752&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781605585161

SP - 17

EP - 24

BT - Proceedings of the 26th International Conference On Machine Learning, ICML 2009

ER -