30 research outputs found
Piecewise linear classifiers based on nonsmooth optimization approaches
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
A method for minimizing convex functions based on continuous approximations to the subdifferential
An optimization-based approach to patient grouping for acute healthcare in Australia
The problem of cluster analysis is formulated as a problem of nonsmooth, nonconvex optimization, and an algorithm for solving the cluster analysis problem based on the nonsmooth optimization techniques is developed. The issues of applying this algorithm to large data sets are discussed and a feature selection procedure is demonstrated. The algorithm is then applied to a hospital data set to generate new knowledge about different patterns of patients resource consumption.E
Unsupervised and supervised data classification via nonsmooth and global optimization
Clustering, classification, cluster function, nonsmooth optimization, global optimization, 65K05, 90C26, 90C30, 90C90,