Clustering based polyhedral conic functions algorithm in classification
From MaRDI portal
Recommendations
- A polyhedral conic functions based classification method for noisy data
- Separation via polyhedral conic functions
- An incremental piecewise linear classifier based on polyhedral conic separation
- O-PCF algorithm for one-class classification
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
Cites work
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Conic separation of finite sets. I: The homogeneous case
- Max–min separability
- On Weak Subdifferentials, Directional Derivatives, and Radial Epiderivatives for Nonconvex Functions
- Optimal parameter selection in support vector machines
- Polyhedral separability through successive LP
- Radial epiderivatives and set-valued optimization
- Separation via polyhedral conic functions
- Supervised data classification via max-min separability
Cited in
(5)- A polyhedral conic functions based classification method for noisy data
- An incremental piecewise linear classifier based on polyhedral conic separation
- An updated OT-PCF algorithm for one-class classification of tensor datasets
- O-PCF algorithm for one-class classification
- The approximation algorithm based on seeding method for functional \(k\)-means problem
This page was built for publication: Clustering based polyhedral conic functions algorithm in classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514696)
