Support cluster machine
Authors:
Open Access
- 20 June 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 505-512
Abstract
For large-scale classification problems, the training samples can be clustered beforehand as a downsampling pre-process, and then only the obtained clusters are used for training. Motivated by such assumption, we proposed a classification algorithm, Support Cluster Machine (SCM), within the learning framework introduced by Vapnik. For the SCM, a compatible kernel is adopted such that a similarity measure can be handled not only between clusters in the training phase but also between a cluster and a vector in the testing phase. We also proved that the SCM is a general extension of the SVM with the RBF kernel. The experimental results confirm that the SCM is very effective for largescale classification problems due to significantly reduced computational costs for both training and testing and comparable classification accuracies. As a by-product, it provides a promising approach to dealing with privacy-preserving data mining problems.Keywords
This publication has 13 references indexed in Scilit:
- Support vector machines using GMM supervectors for speaker verificationIEEE Signal Processing Letters, 2006
- Training Support Vector Machine using Adaptive Clustering2004
- An improved training algorithm for support vector machines2002
- Incremental Support Vector Machine Classification2002
- Proximal support vector machine classifiers2001
- RSVM: Reduced Support Vector Machines2001
- Improvements to Platt's SMO Algorithm for SVM Classifier DesignNeural Computation, 2001
- 10.1162/15324430152733142Applied Physics Letters, 2000
- Introduction to Pattern Recognition1999
- BIRCH1996