A novel robust generalized eigenvalue proximal support vector machine for pattern classification

Weizhi Xiong

doi:10.1007/s10044-024-01355-z

2024-11-06

PRE

DOI：10.1007/s10044-024-01355-z

原文链接

原文求助

摘要

En 中文

By minimizing the p-order of L-2-norm distance of the objection function of the improved generalized eigenvalue proxi- mal support vector machine (IGEPSVM), the L-2,L-p-LIGEPSVM is proposed in this paper. Firstly, the solution of the L-2,L-p-LIGEPSVM is demonstrated to be related to the minimum eigenvalue of the correlation matrix, and an improved inverse power method is devised to solve the L-2,L-p-LIGEPSVM. Compared with IGEPSVM, L-2,L-p-LIGEPSVM not only retains the advantages of linear IGEPSVM, but also overcomes the shortcomings of exaggeration of outliers based on squared Frobenius-norm distance metrics. Furthermore, the main improvements of L-2,L-p-LIGEPSVM over IGEPSVM are the robustness and learning efficiency in solving outlier problems. Finally, in order to illustrate the effectiveness and accuracy of the proposed algorithms, five other relevant algorithms are tested on the artificial and the UCI datasets. The classification accuracy of the two algorithms of L-2,L-p-LIGEPSVM on the Artificial, Australian, Cancer and Sonar datasets are (83%, 84.2%), (98.70%, 99.25%), (98.84%, 98.77%) and (95.65%, 95.70%), respectitvely, and they are all higher than other related 5 algorithms. Experimental results show that L 2,p-LIGEPSVM has some obvious advantages, such as not sensitive to outliers, resistant to noise, high computational efficiency and effective to classification. It is worth mentioning that we introduce the application of the proposed method and elaborate on its economic value.

Keyword:

Modified inverse power method

Pattern classification

Robust distance metric

L2,p-LIGEPSVM

Modified inverse power method

Pattern classification

Robust distance metric