A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
The core vector machine (CVM) is a recent approach for scaling up kernel methods based on the notion of minimum enclosing ball (MEB). Though conceptually simple, an efficient implementation still requires a sophisticated numerical solver. In this paper, we introduce the enclosing ball (EB) problem where the ball's radius is fixed and thus does not have to be minimized. We develop efficient (1 + ǫ)-approximation algorithms that are simple to implement and do not require any numerical solver. Fordoi:10.1145/1273496.1273611 dblp:conf/icml/TsangKK07 fatcat:eqstuqvcuffr3pmzkpml2r4tnm