Extending tree kernels with topological information

Fabio Aiolli, Giovanni Martino, Alessandro Sperduti

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

6 Citations (Scopus)

Abstract

The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are considered independently from their position within the trees. However, when a match happens in similar positions, more strength could reasonably be given to it. Here, we give a systematic way to enrich a large class of tree kernels with this kind of information without affecting, in almost all cases, the worst case computational complexity. Experimental results show the effectiveness of the proposed approach.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages142-149
Number of pages8
Volume6791 LNCS
EditionPART 1
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event21st International Conference on Artificial Neural Networks, ICANN 2011 - Espoo
Duration: 14 Jun 201117 Jun 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6791 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other21st International Conference on Artificial Neural Networks, ICANN 2011
CityEspoo
Period14/6/1117/6/11

Fingerprint

Computational complexity
kernel
Kernel Methods
Substructure
Kernel Function
Computational Complexity
Experimental Results
Class

Keywords

  • kernel methods
  • machine learning
  • tree kernels

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Aiolli, F., Martino, G., & Sperduti, A. (2011). Extending tree kernels with topological information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 1 ed., Vol. 6791 LNCS, pp. 142-149). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6791 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-21735-7_18

Extending tree kernels with topological information. / Aiolli, Fabio; Martino, Giovanni; Sperduti, Alessandro.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6791 LNCS PART 1. ed. 2011. p. 142-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6791 LNCS, No. PART 1).

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

Aiolli, F, Martino, G & Sperduti, A 2011, Extending tree kernels with topological information. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 edn, vol. 6791 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6791 LNCS, pp. 142-149, 21st International Conference on Artificial Neural Networks, ICANN 2011, Espoo, 14/6/11. https://doi.org/10.1007/978-3-642-21735-7_18
Aiolli F, Martino G, Sperduti A. Extending tree kernels with topological information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 1 ed. Vol. 6791 LNCS. 2011. p. 142-149. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-21735-7_18
Aiolli, Fabio ; Martino, Giovanni ; Sperduti, Alessandro. / Extending tree kernels with topological information. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6791 LNCS PART 1. ed. 2011. pp. 142-149 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{87c4a21bdec34d289c797f683034914c,
title = "Extending tree kernels with topological information",
abstract = "The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are considered independently from their position within the trees. However, when a match happens in similar positions, more strength could reasonably be given to it. Here, we give a systematic way to enrich a large class of tree kernels with this kind of information without affecting, in almost all cases, the worst case computational complexity. Experimental results show the effectiveness of the proposed approach.",
keywords = "kernel methods, machine learning, tree kernels",
author = "Fabio Aiolli and Giovanni Martino and Alessandro Sperduti",
year = "2011",
doi = "10.1007/978-3-642-21735-7_18",
language = "English",
isbn = "9783642217340",
volume = "6791 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "142--149",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 1",

}

TY - GEN

T1 - Extending tree kernels with topological information

AU - Aiolli, Fabio

AU - Martino, Giovanni

AU - Sperduti, Alessandro

PY - 2011

Y1 - 2011

N2 - The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are considered independently from their position within the trees. However, when a match happens in similar positions, more strength could reasonably be given to it. Here, we give a systematic way to enrich a large class of tree kernels with this kind of information without affecting, in almost all cases, the worst case computational complexity. Experimental results show the effectiveness of the proposed approach.

AB - The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are considered independently from their position within the trees. However, when a match happens in similar positions, more strength could reasonably be given to it. Here, we give a systematic way to enrich a large class of tree kernels with this kind of information without affecting, in almost all cases, the worst case computational complexity. Experimental results show the effectiveness of the proposed approach.

KW - kernel methods

KW - machine learning

KW - tree kernels

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

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

U2 - 10.1007/978-3-642-21735-7_18

DO - 10.1007/978-3-642-21735-7_18

M3 - Conference contribution

SN - 9783642217340

VL - 6791 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 142

EP - 149

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -