DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption
From MaRDI portal
Publication:421507
DOI10.1016/j.ejor.2011.01.037zbMath1279.62127OpenAlexW2002477760MaRDI QIDQ421507
Parag C. Pendharkar, Marvin D. Troutt
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.037
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (2)
Quantile-DEA classifiers with interval data ⋮ Developing a model for determining optimal \(\eta\) in DEA-discriminant analysis for predicting suppliers' group membership in supply chain
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid radial basis function and data envelopment analysis neural network for classification
- An interactive method for multiple-objective mathematical programming problems
- Synergies of operations research and data mining
- A discrete particle swarm optimization method for feature selection in binary classification problems
- A mixed integer programming algorithm for minimizing the training sample misclassification cost in two-group classification
- An acceptance system decision rule with data envelopment analysis.
- Mixed integer programming approach of extended DEA--discriminant analysis.
- A generalized performance attribution technique for mutual funds
- Direction-Specific Gradient Scaling for Interactive Multicriterion Optimization Using an Abstract Mass Concept
- A USE OF NONPARAMETRIC TESTS FOR DEA-DISCRIMINANT ANALYSIS: A METHODOLOGICAL COMPARISON
- A misclassification cost‐minimizing evolutionary–neural classification approach
- Data mining. Concepts and techniques
This page was built for publication: DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption
