Resum
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.
| Idioma original | Anglès |
|---|---|
| Pàgines (de-a) | 267-275 |
| Nombre de pàgines | 9 |
| Revista | Frontiers in Artificial Intelligence and Applications |
| Volum | 100 |
| Estat de la publicació | Publicada - 2003 |
Fingerprint
Navegar pels temes de recerca de 'Support vector machines over a discrete structure: a kernel for qualitative orders of magnitude spaces'. Junts formen un fingerprint únic.Com citar-ho
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver