Optimal SVM learning method based on adaptive sparse sampling and granularity shift factor

• Hui Wen,
• Dongshun Jia,
• Zhiqiang Liu,
• Hang Xu,
• Guangtao Hao,

Vol. 16, No. 4, April 30, 2022
10.3837/tiis.2022.04.002, Download Paper (Free):

• Support Vector Machine
• sparse sampling
• granularity
• granularity shift factor
• large scale set

Abstract

To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

Statistics

Cite this article