The Weight Function in the Subtree Kernel is Decisive - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Machine Learning Research Year : 2020

The Weight Function in the Subtree Kernel is Decisive


Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Nevertheless, the analysis of these non-Euclidean data is difficult per se. In this paper, we focus on the subtree kernel that is a convolution kernel for tree data introduced by Vishwanathan and Smola in the early 2000's. More precisely, we investigate the influence of the weight function from a theoretical perspective and in real data applications. We establish on a 2-classes stochastic model that the performance of the subtree kernel is improved when the weight of leaves vanishes, which motivates the definition of a new weight function, learned from the data and not fixed by the user as usually done. To this end, we define a unified framework for computing the subtree kernel from ordered or unordered trees, that is particularly suitable for tuning parameters. We show through eight real data classification problems the great efficiency of our approach, in particular for small datasets, which also states the high importance of the weight function. Finally, a visualization tool of the significant features is derived.
Fichier principal
Vignette du fichier
main.pdf (4.31 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02097593 , version 1 (12-04-2019)
hal-02097593 , version 2 (22-11-2019)
hal-02097593 , version 3 (07-05-2020)



Romain Azaïs, Florian Ingels. The Weight Function in the Subtree Kernel is Decisive. Journal of Machine Learning Research, 2020, 21, pp.1-36. ⟨hal-02097593v3⟩
145 View
101 Download



Gmail Mastodon Facebook X LinkedIn More