Margin maximization in spherical separation
We face the problem of strictly separating two sets of points by means of a sphere, considering the two cases where the center of the sphere is fixed or free, respectively. In particular, for the former we present a fast and simple solution algorithm, whereas for the latter one we use the DC-Algorithm based on a DC decomposition of the error function. Numerical results for both the cases are presented on several classical binary datasets drawn from the literature. Copyright Springer Science+Business Media, LLC 2012
Volume (Year): 53 (2012)
Issue (Month): 2 (October)
|Contact details of provider:|| Web page: http://www.springer.com/math/journal/10589|
|Order Information:||Web: http://link.springer.de/orders.htm|
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- A. Astorino & A. Fuduli & M. Gaudioso, 2010. "DC models for spherical separation," Journal of Global Optimization, Springer, vol. 48(4), pages 657-669, December.
- A. Astorino & M. Gaudioso, 2009. "A fixed-center spherical separation algorithm with kernel transformations for classification problems," Computational Management Science, Springer, vol. 6(3), pages 357-372, August.
When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:2:p:301-322. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.