Zhikun Yuen, Paula Branco, et al.
DSAA 2023
We present a new architecture named Binary Tree of support vector machine (SVM), or BTS, in order to achieve high classification efficiency for multiclass problems. BTS and its enhanced version, c-BTS, decrease the number of binary classifiers to the greatest extent without increasing the complexity of the original problem. In the training phase, BTS has N - 1 binary classifiers in the best situation (N is the number of classes), while it has log4/3 ((N+3)/4) binary tests on average when making a decision. At the same time the upper bound of convergence complexity is determined. The experiments in this paper indicate that maintaining comparable accuracy, BTS is much faster to be trained than other methods. Especially in classification, due to its Log complexity, it is much faster than directed acyclic graph SVM (DAGSVM) and ECOC in problems that have big class number. © 2006 IEEE.
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014
Jihun Yun, Peng Zheng, et al.
ICML 2019
Hannah Kim, Celia Cintas, et al.
IJCAI 2023