Fast Extended One-Versus-Rest Multi-Label Support Vector Machine Using Approximate Extreme Points
Existing extended one-versus-rest multi-label support vector machine (OVR-ESVM) adopting non-linear kernel is seriously restricted by excessive training time when it is applied to large-scale data set. In order to overcome this problem, we improve the OVR-ESVM by introducing the principle of approximate extreme points and new approximate ranking loss to construct a novel extended OVR-ESVM using approximate extreme points (AEML-ESVM). By optimizing only on the representative set which can be acquired via adopting the approximate extreme points method, the AEML-ESVM classication algorithm can substantially shorten the training time and its classication performance is comparable to that of the OVR-ESVM classication algorithm. And it uses the new approximate ranking loss as empirical loss term to exploit label correlation of individual instance directly. Experimental study on three benchmark large-scale data sets illustrates that AEML-ESVM classication algorithm can reduce training time greatly and achieve comparable classication performance with OVR-ESVM classication algorithm. And it is also superior to the existing fast multi-label SVM classication algorithms in terms of classication performance and training time.
Support vector machine, multi-label classication, approximate extreme points, label correlation, non linear kernel.