A polyhedral conic functions based classification method for noisy data

DOI10.3934/JIMO.2020129MaRDI QIDQ2666735zbMATH OpenOpenAlexFDO

Authors Müge Acar, Refail Kasimbeyli

Publication date 23 November 2021

Published in Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/jimo.2020129

zbMATH Keywords

optimizationbinary classificationnoisy datapolyhedral conic functions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Computational learning theory (68Q32)

Recommendations

• Clustering based polyhedral conic functions algorithm in classification
• An incremental piecewise linear classifier based on polyhedral conic separation
• O-PCF algorithm for one-class classification
• Separation via polyhedral conic functions
• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities

Cites work

• scientific article; zbMATH DE number 1333815 (Why is no real title available?)
• scientific article; zbMATH DE number 837698 (Why is no real title available?)
• scientific article; zbMATH DE number 7297334 (Why is no real title available?)
• 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 sharp augmented Lagrangian-based method in constrained non-convex optimization
• An incremental piecewise linear classifier based on polyhedral conic separation
• Class noise vs. attribute noise: A quantitative study of their impacts
• Clustering based polyhedral conic functions algorithm in classification
• Discovering Knowledge in Data
• Max–min separability
• Optimality conditions in nonconvex optimization via weak subdifferentials
• Polyhedral separability through successive LP
• Radial epiderivatives and set-valued optimization
• Separation theorems for nonconvex sets and application in optimization
• Separation via polyhedral conic functions
• Solving the quadratic assignment problem using F-MSG algorithm
• Strictly Increasing Positively Homogeneous Functions with Application to Exact Penalization
• Support-vector networks
• The modified subgradient algorithm based on feasible values

Cited in

(7)

• Generalized derivatives and optimality conditions in nonconvex optimization
• Nonlinear strict cone separation theorems in real normed spaces
• Semi-parametric classification of noisy curves
• Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
• An updated OT-PCF algorithm for one-class classification of tensor datasets
• O-PCF algorithm for one-class classification
• Clustering based polyhedral conic functions algorithm in classification

Describes a project that uses

Uses Software

• O-PCF
• WEKA
• UCI

This page was built for publication: A polyhedral conic functions based classification method for noisy data

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