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 language | English |
---|---|
Title of host publication | ESANN 2019 - Proceedings, 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning |
Publisher | ESANN (i6doc.com) |
Pages | 101-106 |
Number of pages | 6 |
ISBN (Electronic) | 9782875870650 |
State | Published - 2019 |
Externally published | Yes |
Event | 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2019 - Bruges, Belgium Duration: 24 Apr 2019 → 26 Apr 2019 |
Publication series
Name | ESANN 2019 - Proceedings, 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning |
---|
Conference
Conference | 27th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning, ESANN 2019 |
---|---|
Country/Territory | Belgium |
City | Bruges |
Period | 24/04/19 → 26/04/19 |
Bibliographical note
Publisher Copyright:© 2019 ESANN (i6doc.com). All rights reserved.
ASJC Scopus subject areas
- Artificial Intelligence
- Information Systems