Exploiting the ODD framework to define a novel effective graph kernel

Giovanni Martino, Nicoló Navarin, Alessandro Sperduti

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

8 Citations (Scopus)

Abstract

In this paper, we show how the Ordered Decomposition DAGs kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a quite fast graph kernel based on the Subtree kernel (ST), and we improve it by increasing its expressivity by adding new features involving partial tree features. While the worst-case complexity of the new obtained graph kernel does not increase, its effectiveness is improved, as shown on several chemical datasets, reaching state-of-the-art performances.

Original languageEnglish
Title of host publication23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings
Publisheri6doc.com publication
Pages219-224
Number of pages6
ISBN (Electronic)9782875870148
Publication statusPublished - 2015
Event23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Bruges, Belgium
Duration: 22 Apr 201524 Apr 2015

Other

Other23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015
CountryBelgium
CityBruges
Period22/4/1524/4/15

Fingerprint

Decomposition

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Martino, G., Navarin, N., & Sperduti, A. (2015). Exploiting the ODD framework to define a novel effective graph kernel. In 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings (pp. 219-224). i6doc.com publication.

Exploiting the ODD framework to define a novel effective graph kernel. / Martino, Giovanni; Navarin, Nicoló; Sperduti, Alessandro.

23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings. i6doc.com publication, 2015. p. 219-224.

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

Martino, G, Navarin, N & Sperduti, A 2015, Exploiting the ODD framework to define a novel effective graph kernel. in 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings. i6doc.com publication, pp. 219-224, 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015, Bruges, Belgium, 22/4/15.
Martino G, Navarin N, Sperduti A. Exploiting the ODD framework to define a novel effective graph kernel. In 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings. i6doc.com publication. 2015. p. 219-224
Martino, Giovanni ; Navarin, Nicoló ; Sperduti, Alessandro. / Exploiting the ODD framework to define a novel effective graph kernel. 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings. i6doc.com publication, 2015. pp. 219-224
@inproceedings{39acb45ec0f54410b39ee10077181aa8,
title = "Exploiting the ODD framework to define a novel effective graph kernel",
abstract = "In this paper, we show how the Ordered Decomposition DAGs kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a quite fast graph kernel based on the Subtree kernel (ST), and we improve it by increasing its expressivity by adding new features involving partial tree features. While the worst-case complexity of the new obtained graph kernel does not increase, its effectiveness is improved, as shown on several chemical datasets, reaching state-of-the-art performances.",
author = "Giovanni Martino and Nicol{\'o} Navarin and Alessandro Sperduti",
year = "2015",
language = "English",
pages = "219--224",
booktitle = "23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings",
publisher = "i6doc.com publication",

}

TY - GEN

T1 - Exploiting the ODD framework to define a novel effective graph kernel

AU - Martino, Giovanni

AU - Navarin, Nicoló

AU - Sperduti, Alessandro

PY - 2015

Y1 - 2015

N2 - In this paper, we show how the Ordered Decomposition DAGs kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a quite fast graph kernel based on the Subtree kernel (ST), and we improve it by increasing its expressivity by adding new features involving partial tree features. While the worst-case complexity of the new obtained graph kernel does not increase, its effectiveness is improved, as shown on several chemical datasets, reaching state-of-the-art performances.

AB - In this paper, we show how the Ordered Decomposition DAGs kernel framework, a framework that allows the definition of graph kernels from tree kernels, allows to easily define new state-of-the-art graph kernels. Here we consider a quite fast graph kernel based on the Subtree kernel (ST), and we improve it by increasing its expressivity by adding new features involving partial tree features. While the worst-case complexity of the new obtained graph kernel does not increase, its effectiveness is improved, as shown on several chemical datasets, reaching state-of-the-art performances.

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

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

M3 - Conference contribution

AN - SCOPUS:84961825651

SP - 219

EP - 224

BT - 23rd European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2015 - Proceedings

PB - i6doc.com publication

ER -