Clustering based polyhedral conic functions algorithm in classification

DOI10.3934/jimo.2015.11.921zbMath1456.68162OpenAlexW2331257895MaRDI QIDQ2514696

Gurkan Ozturk, Mehmet Tahir Ciftci

Publication date: 3 February 2015

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

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

zbMATH Keywords

classificationlinear programmingcomputational learning theoryk-meanspolyhedral conic cunctions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

A polyhedral conic functions based classification method for noisy data ⋮ The approximation algorithm based on seeding method for functional \(k\)-means problem ⋮ O-PCF algorithm for one-class classification

Uses Software

• UCI-ml
• GAMS
• WEKA

Cites Work

• Unnamed Item
• Unnamed Item
• A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
• A derivative-free method for linearly constrained nonsmooth optimization
• Optimal parameter selection in support vector machines
• On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
• A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
• Radial epiderivatives and set-valued optimization
• Max–min separability
• Separation via polyhedral conic functions
• Polyhedral separability through successive LP

This page was built for publication: Clustering based polyhedral conic functions algorithm in classification