PLAME: Piecewise-Linear Approximate Measure for Additive Kernel SVM

Additive Kernel SVM has been extensively used in many applications, including human activity detection and pedestrian detection. Since training an additive kernel SVM model is very time-consuming, which is not scalable to large-scale datasets, many efficient solutions have been developed in the past...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 2023-10, Vol.35 (10), p.9985-9997
Main Authors: Chan, Tsz Nam, Li, Zhe, U, Leong Hou, Cheng, Reynold
Format: Article
Language:English
Subjects:
Additive kernels
Additives
Computational modeling
Datasets
Human activity recognition
Kernel
Kernels
PLAME
Software algorithms
Support vector machines
SVM
Symbols
Training
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:Additive Kernel SVM has been extensively used in many applications, including human activity detection and pedestrian detection. Since training an additive kernel SVM model is very time-consuming, which is not scalable to large-scale datasets, many efficient solutions have been developed in the past few years. However, most of the existing methods normally fail to achieve one of these three important conditions which are (1) low classification error, (2) low memory space, and (3) low training time. In order to simultaneously fulfill these three conditions, we develop the new piecewise-linear approximate measure (PLAME) for additive kernels. By incorporating PLAME with the well-known dual coordinate descent method, we theoretically show that this approach can achieve the above three conditions. Experimental results on twelve real datasets show that our approach can achieve the best trade-off between the accuracy, memory space, and training time compared with different types of state-of-the-art methods.
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2023.3253263