Variants of Tree Kernels for XML Documents

In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might be labeled by a vector of attributes including its XML tag and the textual content. We describe four new kernels suitable for this kind of trees: a tree kernel derived from the well-known parse tree kernel, the set tree kernel that allows permutations of children, the string tree kernel being an extension of the so-called partial tree kernel, and the soft tree kernel, which is based on the set tree kernel and takes into a account a “fuzzy” comparison of child positions. We present first results on an artificial data set, a corpus of newspaper articles, for which we want to determine the type (genre) of an article based on its structure alone, and the well-known SUSANNE corpus.

• Type: Conference
• Year: 2007
• Where: MICAI
• Authors: Peter Geibel, Helmar Gust, Kai-Uwe Kühnberger
• Keywords: Artificial Intelligence, MICAI 2007, Set Tree Kernel, String Tree Kernel, Tree Kernel