Gaertner, Thomas; Lloyd, John; Flach, Peter
This paper brings together two strands of machine learning of increasing importance: kernel methods and highly structured data. We propose a general method for constructing a kernel following the syntactic structure of the data, as defined by its type signature in a higher-order logic. Our main theoretical result is the positive definiteness of any kernel thus defined. We report encouraging experimental results on a range of real-world data sets. By converting our kernel to a distance...[Show more]
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.