Least squares minimum class variance support vector machines

Panayides, Michalis and Artemiou, Andreas ORCID: https://orcid.org/0000-0002-7501-4090 2024. Least squares minimum class variance support vector machines. Computers 13 (2) , 34. 10.3390/computers13020034

PDF - Published Version Download (401kB)

Abstract

In this paper, we propose a Support Vector Machine (SVM)-type algorithm, which is statistically faster among other common algorithms in the family of SVM algorithms. The new algorithm uses distributional information of each class and, therefore, combines the benefits of using the class variance in the optimization with the least squares approach, which gives an analytic solution to the minimization problem and, therefore, is computationally efficient. We demonstrate an important property of the algorithm which allows us to address the inversion of a singular matrix in the solution. We also demonstrate through real data experiments that we improve on the computational time without losing any of the accuracy when compared to previously proposed algorithms.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Additional Information:	License information from Publisher: LICENSE 1: URL: https://creativecommons.org/licenses/by/4.0/, Type: open-access
Publisher:	MDPI
ISSN:	2073-431X
Date of First Compliant Deposit:	9 February 2024
Date of Acceptance:	24 January 2024
Last Modified:	22 Feb 2024 16:45
URI:	https://orca.cardiff.ac.uk/id/eprint/166221

Actions (repository staff only)

Edit Item