Weighted linear loss multiple birth support vector machine based on information granulation for multi-class classification

Abstract

Recently proposed weighted linear loss twin support vector machine (WLTSVM) is an efficient algorithm for binary classification. However, the performance of multiple WLTSVM classifier needs improvement since it uses the strategy ‘one-versus-rest’ with high computational complexity. This paper presents a weighted linear loss multiple birth support vector machine based on information granulation (WLMSVM) to enhance the performance of multiple WLTSVM. Inspired by granular computing, WLMSVM divides the data into several granules and builds a set of sub-classifiers in the mixed granules. By introducing the weighted linear loss, the proposed approach only needs to solve simple linear equations. Moreover, since WLMSVM uses the strategy “all-versus-one” which is the key idea of multiple birth support vector machine, the overall computational complexity of WLMSVM is lower than that of multiple WLTSVM. The effectiveness of the proposed approach is demonstrated by experimental results on artificial datasets and benchmark datasets.