Support vector machines (SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper, we propose a novel kernel based incremental data clustering approach and its use for scaling non-linear support vector machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of support vector machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense
Published in:
Computing: Theory and Applications, 2007. ICCTA '07. International Conference on
Date of Conference: 5-7 March 2007