๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A generalized Gilbert's algorithm for approximating general SVM classifiers

โœ Scribed by Zhenbing Liu; JianGuo Liu; Zhong Chen

Book ID
113816384
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
222 KB
Volume
73
Category
Article
ISSN
0925-2312

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A generalized Sโ€“K algorithm for learning
A generalized Sโ€“K algorithm for learning ฮฝ-SVM classifiers
โœ Qing Tao; Gao-wei Wu; Jue Wang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB

The S-K algorithm (Schlesinger-Kozinec algorithm) and the modified kernel technique due to Friess et al. have been recently combined to solve SVM with L 2 cost function. In this paper, we generalize S-K algorithm to be applied for soft convex hulls. As a result, our algorithm can solve m-SVM based o

A (1โ€“)-approximation algorithm for the g
A (1โ€“)-approximation algorithm for the generalized assignment problem
โœ Zeev Nutov; Israel Beniaminy; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 173 KB

We give a (1-1/e)-approximation algorithm for the max-profit generalized assignment problem (Max-GAP) with fixed profits when the profit (but not necessarily the size) of every item is independent from the bin it is assigned to. The previously best-known approximation ratio for this problem was 1 2