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 magnitudes 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 |
|---|---|
| Pages (from-to) | 267-275 |
| Number of pages | 9 |
| Journal | Frontiers in Artificial Intelligence and Applications |
| Volume | 100 |
| Publication status | Published - 2003 |
Keywords
- Learning algorithms
- Orders of magnitude reasoning
- Support vector machines
Fingerprint
Dive into the research topics of 'Support vector machines over a discrete structure: a kernel for qualitative orders of magnitude spaces'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver