Novel approaches to the discrimination problem

DOI10.1007/BF01416243MaRDI QIDQ4031377zbMATHOpenAlexFDO

Authors Gilles Savard, P. Marcotte

Publication date 1 April 1993

Published in ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01416243

zbMATH Keywords

discriminant analysisdiscriminationhyperplanelinear bilevel program

Mathematics Subject Classification ID

Quadratic programming (90C20) Applications of mathematical programming (90C90) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)

Recommendations

• A new implicit enumeration scheme for the discriminant analysis problem
• Max–min separability
• Discriminant analysis and linear programming
• The surgical separation of sets
• Polyhedral separability through successive LP

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• A comparison of a robust mixed-integer approach to existing methods for establishing classification rules for the discriminant problem
• Computational complexity of norm-maximization
• Discriminant analysis via mathematical programming: Certain problems and their causes
• Evaluating the maximize minimum distance formulation of the linear discriminant problem
• Finding the nearest point in A polytope
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems
• Maximization of A convex quadratic function under linear constraints
• On the complexity of four polyhedral set containment problems
• Simple but powerful goal programming models for discriminant problems
• The densest hemisphere problem

Cited in

(18)

• On \(p\)-norm linear discrimination
• Failure discrimination and rating of enterprises by semi-definite programming
• Exact \(L_{2}\)-norm plane separation
• Artificial neural networks with uniform norm-based loss functions
• On the combinatorics of the 2-class classification problem
• A tabu search with an oscillation strategy for the discriminant analysis problem
• Tabu search approaches for solving the two-group classification problem
• Optimal expected-distance separating halfspace
• Prejudice, bias and identity neutral policy
• Discrimination by means of a trust region method
• MOP/GP models for machine learning
• Failure discrimination and rating of enterprises by semi-definite programming
• A new implicit enumeration scheme for the discriminant analysis problem
• Artificial distinction and real discrimination
• Bilevel optimization: theory, algorithms, applications and a bibliography
• Solution of identification problem.
• A hybrid tabu-ascent algorithm for the linear bilevel programming problem
• Bilevel and multilevel programming: A bibliography review

This page was built for publication: Novel approaches to the discrimination problem

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