Title: Binary tree multi-class SVM based on OVA approach and variable neighbourhood search algorithm

Authors: Boutkhil Sidaoui; Kaddour Sadouni

Addresses: Université des Sciences et de la Technologie d'Oran Mohamed Boudiaf, USTO-MB, BP 1505, El M'naouer, 31000 Oran, Algeria ' Université des Sciences et de la Technologie d'Oran Mohamed Boudiaf, USTO-MB, BP 1505, El M'naouer, 31000 Oran, Algeria

Abstract: In this paper, we propose and examine the performance of an approach multiclass SVM, based on binary tree and VNS algorithm. In order to solve real multiclass problems, a mapping of the original problem to several sub-problems is used to improve the performance of multiclass SVM. The proposed paradigm is composed of two steps; in the first, we start with the construction of binary tree, using a partitioning technique, where each node is a partition of two classes. In the second step, we calculate the optimal binary tree by VNS algorithm, with the aim to explore the search space and to avoid the problem of local minima, the search process of optimisation is guided by one-versus-all strategy. In the subject to improve the temporal complexity of multiclass SVM by reducing the support vectors number and decrease the recognition time. This combination leads to decrease the test time and improve the convergence of classifier.

Keywords: SVM multi-class; OVA; VNS; classification; binary tree.

DOI: 10.1504/IJCAT.2017.084772

International Journal of Computer Applications in Technology, 2017 Vol.55 No.3, pp.183 - 190

Received: 16 Dec 2015
Accepted: 08 Jul 2016

Published online: 26 Jun 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article