We develop the notion of normalized information distance (NID) [7] into a kernel distance suitable for use with a Support Vector Machine classifier, and demonstrate its use for an...
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...
In this paper, we discuss 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 la...
Peter Geibel, Olga Pustylnikov, Alexander Mehler, ...
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...