title: An efficient topological distance-based tree kernel.
abstract: Tree kernels proposed in the literature rarely use information about the relative location of the substructures within a tree. As this type of information is orthogonal to the one commonly exploited by tree kernels, the two can be combined to enhance state-of-the-art accuracy of tree kernels. In this brief, our attention is focused on subtree kernels. We describe an efficient algorithm for injecting positional information into a tree kernel and present ways to enlarge its feature space without affecting its worst case complexity. The experimental results on several benchmark datasets are presented showing that our method is able to reach state-of-the-art performances, obtaining in some cases better performance than computationally more demanding tree kernels.
authors.forename: Fabio
authors.initials: F
authors.lastname: Aiolli
authors.forename: Giovanni
authors.initials: G
authors.lastname: Da San Martino
authors.forename: Alessandro
authors.initials: A
authors.lastname: Sperduti