On the definition of complex structured feature spaces

Nicolò Navarin, Dinh V. Tran, Alessandro Sperduti

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper, we propose a graph kernel whose feature space is defined by combining pairs of features of an existing base graph kernel. Furthermore, we propose a variation where the feature space is adaptive with respect to the learning task at hand, allowing to learn a representation suited to it. Experimental results on six real-world graph datasets from different domains show that the proposed kernels are able to get a consistent performance improvement over the considered base kernel, and over previously defined feature combination methods in literature.

Original languageEnglish
Title of host publicationESANN 2019 - Proceedings, 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning
PublisherESANN (i6doc.com)
Pages101-106
Number of pages6
ISBN (Electronic)9782875870650
StatePublished - 2019
Externally publishedYes
Event27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2019 - Bruges, Belgium
Duration: 24 Apr 201926 Apr 2019

Publication series

NameESANN 2019 - Proceedings, 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning

Conference

Conference27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2019
Country/TerritoryBelgium
CityBruges
Period24/04/1926/04/19

Bibliographical note

Publisher Copyright:
© 2019 ESANN (i6doc.com). All rights reserved.

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Fingerprint

Dive into the research topics of 'On the definition of complex structured feature spaces'. Together they form a unique fingerprint.

Cite this