.png){kind=icon}
.png){kind=icon}
Return
Fast Multi-Label Low-Rank Linearized SVM Classification Algorithm Based on Approximate Extreme Points
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2854831.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Approximate extreme points
low-rank linearized SVM
multi-label classification
support vector machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations