An incremental piecewise linear classifier based on polyhedral conic separation

DOI10.1007/S10994-014-5449-9MaRDI QIDQ890307zbMATH OpenOpenAlexFDO

Authors Gurkan Ozturk, Refail Kasimbeyli, A. M. Bagirov

Publication date 10 November 2015

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10994-014-5449-9

zbMATH Keywords

classificationnonsmooth nonconvex optimizationdiscrete gradient methodpolyhedral conic separation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56)

Recommendations

• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• Classification through incremental max-min separability
• Empirical risk minimization with piecewise-linear classifiers
• Clustering based polyhedral conic functions algorithm in classification
• Separation via polyhedral conic functions

Cites work

• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• A simple and fast multi-class piecewise linear pattern classifier
• Automated design of multiple-class piecewise linear classifiers
• Classification through incremental max-min separability
• Continuous subdifferential approximations and their applications
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Fast modified global \(k\)-means algorithm for incremental cluster construction
• Locally Trained Piecewise Linear Classifiers
• Margin maximization in spherical separation
• Max–min separability
• Non-smoothness in classification problems
• On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
• Piecewise linear classifiers preserving high local recognition rates.
• Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization
• Polyhedral separability through successive LP
• Radial epiderivatives and set-valued optimization
• Separation via polyhedral conic functions
• Supervised classification and mathematical optimization

Cited in

(9)

• Classification through incremental max-min separability
• Nonlinear strict cone separation theorems in real normed spaces
• A polyhedral conic functions based classification method for noisy data
• Optimization approaches to supervised classification
• Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
• Alternating multiconlitron: a novel framework for piecewise linear classification
• O-PCF algorithm for one-class classification
• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• Clustering based polyhedral conic functions algorithm in classification

Describes a project that uses

Uses Software

• WEKA
• DGM
• UCI

This page was built for publication: An incremental piecewise linear classifier based on polyhedral conic separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890307)