Abstract
Combing one-versus-one decomposition strategy with support vector machine has become an efficient means for multi-label classification problem. But how to speed up its training and test procedures is still a challenging issue. In this paper, we generalize the primary binary support vector machine to construct a double label support vector machine through locating double label instances at marginal region between positive and negative instances, and then design a fast multi-label classification algorithm using the voting rule. Experiments on benchmark datasets Yeast and Scene illustrate that our novel method can be comparable with some existing methods according to some widely used evaluation criteria, and can run faster 17% averagely than the current corresponding method in training procedure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
