Name
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. |
Year | Venue | Keywords |
|---|---|---|
2017 | INTERNATIONAL JOURNAL OF DATA MINING MODELLING AND MANAGEMENT | support vector machine, binary SVM, samples reduction, fast training, support vectors, separating hyperplane, separating margin, decision boundaries, statistical learning, machine learning |
Field | DocType | Volume |
Structured support vector machine,Online machine learning,Data mining,Semi-supervised learning,Active learning (machine learning),Mistake,Computer science,Support vector machine,Filter (signal processing),Artificial intelligence,Computational learning theory,Machine learning | Journal | 9 |
Issue | ISSN | Citations |
1 | 1759-1163 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abdelhamid Djeffal | 1 | 5 | 1.13 |
| Mohamed Chaouki Babahenini | 2 | 0 | 2.03 |
| A. Taleb Ahmed | 3 | 10 | 4.30 |