ϵ-sparse representations : generalized sparse approximation and the equivalent family of SVM tasks

Szabó Zoltán and Lőrincz András: ϵ-sparse representations : generalized sparse approximation and the equivalent family of SVM tasks. In: Acta cybernetica, (17) 3. pp. 605-614. (2006)

[thumbnail of Lorincz_2006_ActaCybernetica.pdf]
Preview
Cikk, tanulmány, mű
Lorincz_2006_ActaCybernetica.pdf

Download (138kB) | Preview

Abstract

Relation between a family of generalized Support Vector Machine (SVM) problems and the novel ϵ-sparse representation is provided. In defining ϵ-sparse representations, we use a natural generalization of the classical ϵ-insensitive cost function for vectors. The insensitive parameter of the SVM problem is transformed into component-wise insensitivity and thus overall sparsification is replaced by component-wise sparsification. The connection between these two problems is built through the generalized Moore-Penrose inverse of the Gram matrix associated to the kernel.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2006
Volume: 17
Number: 3
ISSN: 0324-721X
Page Range: pp. 605-614
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38521/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 613-614. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 16. 10:11
URI: http://acta.bibl.u-szeged.hu/id/eprint/12784

Actions (login required)

View Item View Item