We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Twin Bounded Support Tensor Machine for Classification.
- Authors
Shi, Haifa; Zhao, Xinbin; Zhen, Ling; Jing, Ling
- Abstract
The traditional vector-based classifiers, such as support vector machine (SVM) and twin support vector machine (TSVM), cannot handle tensor data directly and may not utilize the data informations effectively. In this paper, we propose a novel classifier based on tensor data, called twin bounded support tensor machine (TBSTM) which is an extension of twin bounded support vector machine (TBSVM). Similar to TBSVM, TBSTM gets two hyperplanes and obtains the solution by solving two quadratic programming problems (QPPs). The computational complexity of each QPPs is smaller than that of support tensor machine (STM). TBSTM not only retains the advantage of TBSVM, but also has its unique superior characteristics: (1) it makes full use of the structure information of data; (2) it has acceptable or better classification accuracy compared to STM, TBSVM and SVM; (3) the computational cost is basically less than STM; (4) it can deal with large data that TBSVM is not easy to achieve, especially for small-sample-size (S3) problems; (5) it adopts alternating successive over relaxation iteration (ASOR) method to solve optimization problems which accelerates the pace of training. Finally, we demonstrate the effectiveness and superiority by the experiments based on vector and tensor data.
- Subjects
SUPPORT vector machines; DATA analysis; QUADRATIC programming; PROBLEM solving; COMPUTATIONAL complexity; COMPARATIVE studies
- Publication
International Journal of Pattern Recognition & Artificial Intelligence, 2016, Vol 30, Issue 1, p-1
- ISSN
0218-0014
- Publication type
Article
- DOI
10.1142/S0218001416500026