Piecewise linear classifiers based on nonsmooth optimization approaches
Version 2 2024-06-04, 13:50Version 2 2024-06-04, 13:50
Version 1 2019-05-09, 14:59Version 1 2019-05-09, 14:59
chapter
posted on 2024-06-04, 13:50authored byAM Bagirov, R Kasimbeyli, G Öztürk, Julien UgonJulien Ugon
Nonsmooth optimization provides efficient algorithms for solving many machine learning problems. In particular, nonsmooth optimization approaches to supervised data classification problems lead to the design of very efficient algorithms for their solution. In this chapter, we demonstrate how nonsmooth optimization algorithms can be applied to design efficient piecewise linear classifiers for supervised data classification problems. Such classifiers are developed using a max–min and a polyhedral conic separabilities as well as an incremental approach. We report results of numerical experiments and compare the piecewise linear classifiers with a number of other mainstream classifiers.