Context-Sensitive kernel functions: a distance function viewpoint

Authors:
Bram Vanschoenwinkel;Feng Liu;Bernard Manderick
Affiliations:
Computational Modeling Lab, Vrije Universiteit Brussel, Brussel, Belgium;Computational Modeling Lab, Vrije Universiteit Brussel, Brussel, Belgium;Computational Modeling Lab, Vrije Universiteit Brussel, Brussel, Belgium
Venue:
ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
Year:
2005

Citing 3
Cited 1

An introduction to support Vector Machines: and other kernel-based learning methods

An introduction to support Vector Machines: and other kernel-based learning methods
Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms

Learning to Classify Text Using Support Vector Machines: Methods, Theory and Algorithms
Appropriate kernel functions for support vector machine learning with sequences of symbolic data

Proceedings of the First international conference on Deterministic and Statistical Methods in Machine Learning

Real-time highway traffic condition assessment framework using vehicle-infrastructure integration (VII) with artificial intelligence (AI)

IEEE Transactions on Intelligent Transportation Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends the idea of weighted distance functions to kernels and support vector machines. Here, we focus on applications that rely on sliding a window over a sequence of string data. For this type of problems it is argued that a symbolic, context-based representation of the data should be preferred over a continuous, real format as this is a much more intuitive setting for working with (weighted) distance functions. It is shown how a weighted string distance can be decomposed and subsequently used in different kernel functions and how these kernel functions correspond to real kernels between the continuous, real representations of the symbolic, context-based representations of the vectors.