Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points
To solve the problem that traditional multi-label support vector machine (SVM) classification algorithm adopting nonlinear kernel has been severely restricted from being used on large-scale data sets, we propose fast multi-label low-rank-linearized SVM classification algorithm based on approximate e...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8423067/ |
id |
doaj-aa6c9243aa0440589dfd72eaee89ba1a |
---|---|
record_format |
Article |
spelling |
doaj-aa6c9243aa0440589dfd72eaee89ba1a2021-03-29T21:06:59ZengIEEEIEEE Access2169-35362018-01-016423194232610.1109/ACCESS.2018.28548318423067Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme PointsZhongwei Sun0https://orcid.org/0000-0001-8615-7460Keyong Hu1https://orcid.org/0000-0002-6004-6073Tong Hu2Jing Liu3Kai Zhu4School of Information and Control Engineering, Qingdao University of Technology, Qingdao, ChinaSchool of Information and Control Engineering, Qingdao University of Technology, Qingdao, ChinaInstitute of Oceanographic Instrumentation, Shandong Academy of Sciences, Qilu University of Technology, Qingdao, ChinaSchool of Science and Information, Qingdao Agriculture University, Qingdao, ChinaSchool of Information and Control Engineering, Qingdao University of Technology, Qingdao, ChinaTo solve the problem that traditional multi-label support vector machine (SVM) classification algorithm adopting nonlinear kernel has been severely restricted from being used on large-scale data sets, we propose fast multi-label low-rank-linearized SVM classification algorithm based on approximate extreme points (AEML-LLSVM). First, it adopts the approximate extreme points' method to obtain representative sets from the training data set. Then, the approximate extreme points' low-rank-linearized SVM (AELLSVM) is trained on the representative sets. The AELLSVM integrates the advantages of approximate extreme points' method and LLSVM. Experimental results on three large-scale multi-label data sets have proven that the training and the testing speed of AEML-LLSVM classification algorithm are greatly improved under the premise that its classification performance is similar to that of ML-LIBSVM classification algorithm and superior to that of other fast multi-label SVM classification algorithms.https://ieeexplore.ieee.org/document/8423067/Approximate extreme pointslow-rank linearized SVMmulti-label classificationsupport vector machine |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Zhongwei Sun Keyong Hu Tong Hu Jing Liu Kai Zhu |
spellingShingle |
Zhongwei Sun Keyong Hu Tong Hu Jing Liu Kai Zhu Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points IEEE Access Approximate extreme points low-rank linearized SVM multi-label classification support vector machine |
author_facet |
Zhongwei Sun Keyong Hu Tong Hu Jing Liu Kai Zhu |
author_sort |
Zhongwei Sun |
title |
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points |
title_short |
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points |
title_full |
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points |
title_fullStr |
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points |
title_full_unstemmed |
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points |
title_sort |
fast multi-label low-rank linearized svm classification algorithm based on approximate extreme points |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
To solve the problem that traditional multi-label support vector machine (SVM) classification algorithm adopting nonlinear kernel has been severely restricted from being used on large-scale data sets, we propose fast multi-label low-rank-linearized SVM classification algorithm based on approximate extreme points (AEML-LLSVM). First, it adopts the approximate extreme points' method to obtain representative sets from the training data set. Then, the approximate extreme points' low-rank-linearized SVM (AELLSVM) is trained on the representative sets. The AELLSVM integrates the advantages of approximate extreme points' method and LLSVM. Experimental results on three large-scale multi-label data sets have proven that the training and the testing speed of AEML-LLSVM classification algorithm are greatly improved under the premise that its classification performance is similar to that of ML-LIBSVM classification algorithm and superior to that of other fast multi-label SVM classification algorithms. |
topic |
Approximate extreme points low-rank linearized SVM multi-label classification support vector machine |
url |
https://ieeexplore.ieee.org/document/8423067/ |
work_keys_str_mv |
AT zhongweisun fastmultilabellowranklinearizedsvmclassificationalgorithmbasedonapproximateextremepoints AT keyonghu fastmultilabellowranklinearizedsvmclassificationalgorithmbasedonapproximateextremepoints AT tonghu fastmultilabellowranklinearizedsvmclassificationalgorithmbasedonapproximateextremepoints AT jingliu fastmultilabellowranklinearizedsvmclassificationalgorithmbasedonapproximateextremepoints AT kaizhu fastmultilabellowranklinearizedsvmclassificationalgorithmbasedonapproximateextremepoints |
_version_ |
1724193558377791488 |