Abstract
We consider a special case of the optimal separation, via a sphere, of two discrete point sets in a finite dimensional Euclidean space. In fact we assume that the center of the sphere is fixed. In this case the problem reduces to the minimization of a convex and nonsmooth function of just one variable, which can be solved by means of an “ad hoc” method in O(p log p) time, where p is the dataset size. The approach is suitable for use in connection with kernel transformations of the type adopted in the support vector machine (SVM) approach. Despite of its simplicity the method has provided interesting results on several standard test problems drawn from the binary classification literature.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Astorino A, Gaudioso M (2002) Polyhedral separability through successive LP. J OptimTheory Appl 112(2):265–293
Astorino A, Gaudioso M (2005) Ellipsoidal separation for classification problems. Optim Methods Softw 20(2–3):261–270
Bennett KP, Mangasarian OL (1992) Robust linear programming discrimination of two linearly inseparable sets. Optim Methods Softw 1:23–34
Cristianini N, Shawe-Taylor J (2000) An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge
Fung G, Mangasarian OL (2001) Proximal support vector machine classifiers, PDF version data mining institute technical report 01–02, February 2001—Proceedings KDD-2001, San Francisco August 26–29, 2001—Association for Computing Machinery, New York, pp 77–86
Joachims T (1999). Making large-scale support vector machine learning practical. In: Schölkopf B, Burges CJC, Smola AJ (eds) Advances in kernel methods: support vector learning. MIT, Cambridge, pp 169–184
Mangasarian OL (1965) Linear and nonlinear separation of patterns by linear programming. Oper Res 13:444–452
Murphy PM, Aha DW (1992) UCI repository of machine learning databases, http://www.ics.uci.edu/~mlearn/MLRepository.html
Odewahn S, Stockwell E, Pennington R, Humphreys R, Zumach W (1992) Automated star/galaxy discrimination with neural networks. Astron J 103(1):318–331
Rosen JB (1965) Pattern separation by convex programming. J Math Anal Appl 10:123–134
Schölkopf B, Burges CJC, Smola AJ (eds) (1999) Advances in kernel methods: support vector learning. MIT, Cambridge
Tax DMJ, Duin RPW (1999) Data domain description using support vectors. In: ESANN’1999 proceedings Bruges (Belgium), 21–23 April 1999, D-Facto public, ISBN 2-600049-9-x, pp 251–256
Vapnik V (1995) The nature of the statistical learning theory. Springer, New York
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has been partially supported by the Italian “Ministero dell’Istruzione, dell’Università e della Ricerca Scientifica”, under PRIN project Numerical Methods for Global Optimization and for some classes of Nonsmooth Optimization Problems (2005017083.002).
Rights and permissions
About this article
Cite this article
Astorino, A., Gaudioso, M. A fixed-center spherical separation algorithm with kernel transformations for classification problems. Comput Manag Sci 6, 357–372 (2009). https://doi.org/10.1007/s10287-007-0051-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10287-007-0051-2