Pattern separation by convex programming
From MaRDI portal
Publication:2396115
DOI10.1016/0022-247X(65)90150-2zbMath0134.37503OpenAlexW2102677843MaRDI QIDQ2396115
Publication date: 1965
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(65)90150-2
Related Items (21)
A fixed-center spherical separation algorithm with kernel transformations for classification problems ⋮ Clustering via minimum volume ellipsoids ⋮ On numerical solving the spherical separability problem ⋮ Optimal Data Fitting: A Moment Approach ⋮ Binary classification via spherical separator by DC programming and DCA ⋮ Ellipsoidal separation for classification problems ⋮ An optimal algorithm for pattern classification† ⋮ DC models for spherical separation ⋮ Construction and application of an ellipsoidal convex model using a semi-definite programming formulation from measured data ⋮ The emergence of fuzzy sets in the decade of the perceptron -- Lotfi A. Zadeh's and Frank Rosenblatt's research work on pattern classification ⋮ Scale-invariant clustering with minimum volume ellipsoids ⋮ A generalization of Löwner-John's ellipsoid theorem ⋮ Optimization approaches to supervised classification ⋮ A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis ⋮ A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ A mixed integer programming approach to multi-spectral image classification ⋮ Separation of convex sets by Clarke subdifferential ⋮ Aplicabilidad de la programacion matematica en la estimacion de funciones discriminantes ⋮ Minimum Ellipsoids ⋮ Applications of semidefinite programming ⋮ Polyhedral separation via difference of convex (DC) programming
Cites Work
This page was built for publication: Pattern separation by convex programming
