SVM-KM: speeding SVMs learning with a priori cluster selection and k-means
Authors:
- M. Barros de AlmeidaMAM. Barros de Almeida
- A. de Padua BragaABA. de Padua Braga
- J.P. BragaJBJ.P. Braga
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 162
Abstract
A procedure called SVM-KM, based on clustering by k-means and to accelerate the training of Support Vector Machine, is the main objective of the present work. During the Support Vector Machines (SVMs) optimization phase, training vectors near the separation margins are likely to become support vector and must be preserved. Conversely, training vectors far from the margins are not in general taken into account for SVM's design process. SVM-KM groups the training vector in many clusters. Clusters formed only by a vector that belongs to the same class label can be disregard and only cluster centers are used. On the other hand, clusters with more than one class label are unchanged and all training vectors belonging to them are considered. Cluster with mixed composition are likely to happen near the separation margins and they may hold some support vectors. Consequently, the number of vectors in a SVM training is smaller and the training time can be decreased without compromising the generalization capability of the SVM.Keywords
This publication has 5 references indexed in Scilit:
- Knowledge-based analysis of microarray gene expression data by using support vector machinesProceedings of the National Academy of Sciences, 2000
- On domain knowledge and feature selection using a support vector machinePattern Recognition Letters, 1999
- Support vector machines for spam categorizationIEEE Transactions on Neural Networks, 1999
- Successive overrelaxation for support vector machinesIEEE Transactions on Neural Networks, 1999
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982