An efficient multi-label support vector machine with a zero label

Existing multi-label support vector machine (Rank-SVM) has an extremely high computational complexity and lacks an intrinsic zero point to determine relevant labels. In this paper, we propose a novel support vector machine for multi-label classification through both simplifying Rank-SVM and adding a...

Full description

Saved in:
Bibliographic Details
Published in:Expert systems with applications 2012-04, Vol.39 (5), p.4796-4804
Main Author: Xu, Jianhua
Format: Article
Language:English
Subjects:
Benchmarking
Classification
Computational efficiency
Expert systems
Frank–Wolfe method
Labels
Linear programming
Multi-label classification
Quadratic programming
Support vector machine
Support vector machines
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Existing multi-label support vector machine (Rank-SVM) has an extremely high computational complexity and lacks an intrinsic zero point to determine relevant labels. In this paper, we propose a novel support vector machine for multi-label classification through both simplifying Rank-SVM and adding a zero label, resulting into a quadratic programming problem in which each class has an independent equality constraint. When Frank–Wolfe method is used to solve our quadratic programming problem iteratively, our entire linear programming problem of each step is divided into a series of sub-problems, which dramatically reduces computational cost. It is illustrated that for famous Yeast data set our training procedure runs about 12 times faster than Rank-SVM does under C++ environment. Experiments from five benchmark data sets show that our method is a powerful candidate for multi-label classification, compared with five state-of-the–art multi-label classification techniques.
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2011.09.138