Efficient data selection approach in projected feature space for fast training support vector machines Online publication date: Fri, 10-Apr-2015
by Sonia Chaibi; Mohamed Tayeb Laskri
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 9, No. 3, 2014
Abstract: Support vector machines (SVMs) have shown superior performance compared to other machine learning techniques, especially in classification problems. Yet one limitation is the long computational training time which increases with the data size. This problem has been investigated thoroughly and different algorithms for classification have been used with various success rates. Among them, clustering techniques have shown a considerable success to reduce SVM's data training. However, once these solutions are used for large scale datasets it becomes clear that using only clustering approaches is insufficient. In this paper, we tackle the problem of how to combine clustering methods and feature reducing techniques to minimise efficiently SVM's complexity. Several experiments on different datasets show that the proposed solution can be a promised way for fast training SVMs on large scale datasets.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook