Statistical learning theory make large margins an important property of linear classifiers and Support Vector Machines were designed with this target in mind. However, it has been shown that large margins can also be obtained when much simpler kernel perceptrons are used together with ad–hoc updating rules, different in principle from Rosenblatt’s rule. In this work we will numerically demonstrate that, rewritten in a convex update setting and using an appropriate updating vector selection procedure, Rosenblatt’s rule does indeed provide maximum margins for kernel perceptrons, although with a convergence slower than that achieved by other more sophisticated methods, such as the Schlesinger–Kozinec (SK) algorithm.
KeywordsSupport Vector Machine Large Margin Breast Cancer Dataset Weight Update Norm Margin
Unable to display preview. Download preview PDF.
- Joachims, T.: Making Large-Scale Support Vector Machine Learning Practical. In: Scholkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel methods, pp. 169–184. MIT Press, Cambridge (1999)Google Scholar
- Li, Y., Long, P.M.: The relaxed online maximum margin algorithm. In: Solla, S.A., Leen, T.K., Muller, K.R. (eds.) Advances in Neural Information Processing Systems, 12th edn., pp. 498–504. MIT Press, Cambridge (2000)Google Scholar
- Platt, J.C.: Fast training of support vector machines using sequential minimal optimization. In: Scholkopf, B., Burges, C., Smola, A. (eds.) Advances in Kernel methods, pp. 185–208. MIT Press, Cambridge (1999)Google Scholar
- Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge Univ. Press, Cambridge (2004)Google Scholar
- Schölkopf, B., Smola, A.J.: Learning with Kernels. MIT Press, Cambridge (2001)Google Scholar
- UCI-benchmark repository of machine learning data sets, University of California Irvine, http://www.ics.uci.edu