Intersection and signed-intersection kernels for intervals

Francisco J. Ruiz, Cecilio Angulo, Núria Agell

Research output: Book chapterConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationArtificial Intelligence Research and Development. Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
PublisherIOS Press
Number of pages9
ISBN (Print)9781586039257
Publication statusPublished - 2008

Publication series

NameFrontiers in Artificial Intelligence and Applications
ISSN (Print)0922-6389


  • Qualitative Reasoning
  • interval analysis
  • kernel methods


Dive into the research topics of 'Intersection and signed-intersection kernels for intervals'. Together they form a unique fingerprint.

Cite this