Fast binary support vector machine learning method by samples reduction

Abdelhamid Djeffal, Mohemed Chaouki Babahenini and Abdelmalik Taleb-Ahmed

International Journal of Data Mining, Modelling and Management, 2017, vol. 9, issue 1, 1-16

Abstract: Support vector machine is a well-known method of statistical learning by its good accuracy; however, its training time is very poor especially in case of huge databases. Many research works aim to reduce training samples to improve training time without significant loss in accuracy. In this paper, we propose a method called CB-SR, based on filtering and revision stages to eliminate samples that have little influence on learning results. Filtering stage uses a covering-based principle of samples to eliminate those faraway from decision boundaries and keep the closest ones. Revision stage allows to add after the first learning, samples eventually discarded by mistake. The results we obtain show the benefits of our approach over others existing ones.

Keywords: support vector machines; binary SVM; sample reduction; fast training; support vectors; separating hyperplane; separating margin; decision boundaries; statistical learning; machine learning. (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=82555 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdmmm:v:9:y:2017:i:1:p:1-16

Access Statistics for this article

More articles in International Journal of Data Mining, Modelling and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().