Evaluating the maximize minimum distance formulation of the linear discriminant problem

DOI10.1016/0377-2217(89)90390-1MaRDI QIDQ1119468zbMATH OpenOpenAlexFDO

Authors Paul A. Rubin

Publication date 1989

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(89)90390-1

zbMATH Keywords

statisticsmaximize minimum distancetwo-group discriminant problem

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Linear programming (90C05) Applications of mathematical programming (90C90)

Recommendations

• An experimental comparison of some recently developed linear programming approaches to the discriminant problem
• The two-group discriminant problem with equal group mean vectors: An experimental evaluation of six linear/nonlinear programming formulations
• scientific article; zbMATH DE number 1034070
• Improper linear discriminant classifiers
• An iterative mixed integer programming method for classification accuracy maximizing discriminant analysis

Cites work

• Simple but powerful goal programming models for discriminant problems

Cited in

(9)

• Examining the effect of second-order terms in mathematical programming approaches to the classification problem
• A comment regarding polynomial discriminant functions
• Improper linear discriminant classifiers
• Discrimination by means of a trust region method
• New LP based heuristics for the classification problem
• Second order mathematical programming formulations for discriminant analysis
• Minimum distance probability discriminant analysis for mixed variables
• Novel approaches to the discrimination problem
• A mixed integer programming model for multiple-class discriminant analysis

This page was built for publication: Evaluating the maximize minimum distance formulation of the linear discriminant problem

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