Title: Benchmarking tree-based least squares twin support vector machine classifiers

Authors: Mayank Arya Chandra; S.S. Bedi

Addresses: Department of CS and IT, MJP Rohilkhand University, Bareilly, UP, India ' Department of CS and IT, MJP Rohilkhand University, Bareilly, UP, India

Abstract: Least square twin support vector machine is an emerging learning method applied in classification problem. This paper present a tree-based least square twin support vector machine (T-LSTWSVM) for classification. Classification procedure depends on the correlation of input feature as well as output feature. UCI benchmark data sets are used to evaluate the test set performance of tree-based least square twin support vector machine (T-LSTWSVM) classifiers with multiple kernel functions such as linear, polynomial and radial basis function (RBF) kernels. This method applies on two main types of classification problems such as binary class problem as well as multi-class problem. The evaluation and accuracy is calculated in terms of distance metric. It was observed that multi-class classification problem performed excellently by tree-based method.

Keywords: binary tree; classification; hyper plane; kernel function; machine learning; support vector machine; SVM; least square twin SVM.

DOI: 10.1504/IJBIDM.2020.106135

International Journal of Business Intelligence and Data Mining, 2020 Vol.16 No.3, pp.381 - 395

Received: 18 Jun 2017
Accepted: 04 Oct 2017

Published online: 13 Feb 2020 *

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