Abstract
This paper is within the domain of the study of learning algorithms based on kernels, precisely of the Support Vector Machines. a kernel is constructed over the discrete structure of absolute orders of magnitude spaces. This kernel is based on an explicit function, defined from the space of k-tuples of qualitative labels to a feature space, which captures the remoteness between the components of the patterns by using certain weights exponentially. a simple example that allows interpreting the kernel in terms of proximity of the patterns is presented.
Original language | English |
---|---|
Title of host publication | Artificial intelligence research and development |
Pages | 267-275 |
Publication status | Published - 1 Jan 2003 |