Conference Paper

Intersection and Signed-Intersection Kernels for Intervals

DOI: 10.3233/978-1-58603-925-7-262 Conference: Artificial Intelligence Research and Development, Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence, CCIA 2008, October 22-24, 2008, Sant Martí d'Empúries, Spain
Source: DBLP


In this paper two kernels for interval data based on the intersection operation are introduced. On the one hand, it is demonstrated that the intersection length of two intervals is a positive definite (PD) kernel. On the other hand, a signed variant of this kernel, which also permits discriminating between disjoint intervals, is demonstrated to be a conditionally positive definite (CPD) kernel. The potentiality and performance of the two kernels presented when applying them to learning machine techniques based on kernel methods are shown by considering three different examples involving interval data.

Download full-text


Available from: Cecilio Angulo, Mar 17, 2014