DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption

DOI10.1016/j.ejor.2011.01.037zbMath1279.62127MaRDI 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

zbMATH Keywords

discriminant analysis; data envelopment analysis; goal programming; data mining; dimensionality reduction

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

Developing a model for determining optimal \(\eta\) in DEA-discriminant analysis for predicting suppliers' group membership in supply chain, Quantile-DEA classifiers with interval data

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