Binary tree multi-class SVM based on OVA approach and variable neighbourhood search algorithm Online publication date: Mon, 26-Jun-2017
by Boutkhil Sidaoui; Kaddour Sadouni
International Journal of Computer Applications in Technology (IJCAT), Vol. 55, No. 3, 2017
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.
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 Computer Applications in Technology (IJCAT):
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