On the public citation graph

Novel approaches to the discrimination problem

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-05269-3_3openalex-snapshot
Deterministic Approaches
inferredcites →https://doi.org/10.1007/bf01580380openalex-snapshot
Maximization of A convex quadratic function under linear constraints
inferredcites →https://doi.org/10.1007/bf01580381openalex-snapshot
Finding the nearest point in A polytope
inferredcites →https://doi.org/10.1007/bf01582241openalex-snapshot
On the complexity of four polyhedral set containment problems
inferredcites →https://doi.org/10.1007/bf01587074openalex-snapshot
A polynomial-time algorithm for a class of linear complementarity problems
inferredcites →https://doi.org/10.1007/bf02123011openalex-snapshot
Computational complexity of norm-maximization
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1016/0304-3975(78)90006-3openalex-snapshot
The densest hemisphere problem
inferredcites →https://doi.org/10.1016/0305-0548(89)90007-5openalex-snapshot
Discriminant analysis via mathematical programming: Certain problems and their causes
inferredcites →https://doi.org/10.1016/0377-2217(81)90048-5openalex-snapshot
Simple but powerful goal programming models for discriminant problems
inferredcites →https://doi.org/10.1016/0377-2217(87)90170-6openalex-snapshot
An experimental comparison of several approaches to the discriminant problem with both qualitative and quantitative variables
inferredcites →https://doi.org/10.1016/0377-2217(89)90390-1openalex-snapshot
Evaluating the maximize minimum distance formulation of the linear discriminant problem
inferredcites →https://doi.org/10.1016/0377-2217(90)90304-topenalex-snapshot
A comparison of a robust mixed-integer approach to existing methods for establishing classification rules for the discriminant problem
inferredcites →https://doi.org/10.1111/j.1469-1809.1936.tb02137.xopenalex-snapshot
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
inferredcites →https://doi.org/10.1111/j.1540-5915.1981.tb00061.xopenalex-snapshot
Applications and Implementation
inferredcites →https://doi.org/10.1111/j.1540-5915.1982.tb00139.xopenalex-snapshot
ON USING LINEAR PROGRAMMING IN DISCRIMINANT PROBLEMS
inferredcites →https://doi.org/10.1111/j.1540-5915.1982.tb01185.xopenalex-snapshot
AN EXPERIMENTAL COMPARISON OF STATISTICAL AND LINEAR PROGRAMMING APPROACHES TO THE DISCRIMINANT PROBLEM
inferredcites →https://doi.org/10.1111/j.1540-5915.1989.tb01875.xopenalex-snapshot
Characterization of Unacceptable Solutions in LP Discriminant Analysis*
inferredcites →https://doi.org/10.1111/j.1540-5915.1990.tb00317.xopenalex-snapshot
Minimizing Misclassifications in Linear Discriminant Analysis*
inferredcites →https://doi.org/10.1111/j.1540-5915.1990.tb01249.xopenalex-snapshot
Improved Linear Programming Models for Discriminant Analysis*
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.5094232openalex-extracted
Bounding Human Effort in Augmented Intelligence Systems
inferred← citeshttps://doi.org/10.1007/11399346_8openalex-snapshot
Generating Support Vector Machines Using Multi-Objective Optimization and Goal Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-52119-6_20openalex-snapshot
Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
inferred← citeshttps://doi.org/10.1007/bf00121266openalex-snapshot
A hybrid Tabu-ascent algorithm for the linear Bilevel Programming Problem
inferred← citeshttps://doi.org/10.1007/bf01096458openalex-snapshot
Bilevel and multilevel programming: A bibliography review
inferred← citeshttps://doi.org/10.1007/s10444-024-10124-9openalex-snapshot
Artificial neural networks with uniform norm-based loss functions
inferred← citeshttps://doi.org/10.1007/s10479-009-0581-9openalex-snapshot
Tabu search approaches for solving the two-group classification problem
inferred← citeshttps://doi.org/10.1007/s11590-007-0074-1openalex-snapshot
Exact L 2-norm plane separation
inferred← citeshttps://doi.org/10.1016/j.cor.2009.11.016openalex-snapshot
A tabu search with an oscillation strategy for the discriminant analysis problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.03.043openalex-snapshot
MOP/GP models for machine learning
inferred← citeshttps://doi.org/10.1016/j.patcog.2018.11.024openalex-snapshot
Linear classifier design in the weight space
inferred← citeshttps://doi.org/10.1016/s1005-8885(10)60072-6openalex-snapshot
Urban scene recognition by graphical model and 3D geometry
inferred← citeshttps://doi.org/10.1023/a:1018958001886openalex-snapshot
Nontraditional approaches to statistical classification: Some perspectives on L_p-norm methods
inferred← citeshttps://doi.org/10.1080/0233193031000149894openalex-snapshot
Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
inferred← citeshttps://doi.org/10.1109/ijcnn.2007.4371051openalex-snapshot
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.30071openalex-snapshot
Improving Neural Network Generalization on Data-Limited Regression with Doubly-Robust Boosting
inferred← citeshttps://doi.org/10.48550/arxiv.1903.05499openalex-snapshot
DeepOBS: A Deep Learning Optimizer Benchmark Suite
inferred← citeshttps://doi.org/10.48550/arxiv.2107.08800openalex-snapshot
Deep Learning with Nonsmooth Objectives
inferred← citeshttps://doi.org/10.5351/kjas.2005.18.2.421openalex-snapshot
Study on Support Vector Machines Using Mathematical Programming
inferred← citeshttps://doi.org/10.70675/bd8a284dz0ddcz4560z99c0z9244f8a590beopenalex-snapshot
Optimization of deep neural network : a functional perspective with applications in image classification
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.