Variable selection in data envelopment analysis: A random forest approach with data augmentation

Variable selection is an important step in data envelopment analysis (DEA) when the number of decision making units (DMUs) is insufficient. This research thus proposes a two-stage variable selection method integrating a well-known supervised machine learning technique, the random forest algorithm. In the first stage, a baseline DEA model with full input and output variables is implemented and each DMU can be determined as being efficient or inefficient. In the second stage, a random forest is trained to learn how to classify efficient or inefficient DMUs well in high dimensions. Accordingly, the importance of each variable can be calculated based on permutation importance indices in random forest. This paper further discusses two issues about data augmentation in order to improve the robustness of permutation importance when the number of DMUs is quite small.

Authors

Publication Details

Journal
Decision Science Letters
Published
2026-01-01
DOI
https://doi.org/10.5267/j.dsl.2026.2.008
Citations
1
Primary Topic
Efficiency Analysis Using DEA
Type
article
Field-Weighted Citation Impact
58.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Variable selection in data envelopment analysis: A random forest approach with data augmentation

Tzu-Pu Chang
1 citations
Decision Science Letters
Efficiency Analysis Using DEA
58.08
article

Variable selection in data envelopment analysis: A random forest approach with data augmentation

Tzu-Pu Chang
article en
1 citations

Abstract

Variable selection is an important step in data envelopment analysis (DEA) when the number of decision making units (DMUs) is insufficient. This research thus proposes a two-stage variable selection method integrating a well-known supervised machine learning technique, the random forest algorithm. In the first stage, a baseline DEA model with full input and output variables is implemented and each DMU can be determined as being efficient or inefficient. In the second stage, a random forest is trained to learn how to classify efficient or inefficient DMUs well in high dimensions. Accordingly, the importance of each variable can be calculated based on permutation importance indices in random forest. This paper further discusses two issues about data augmentation in order to improve the robustness of permutation importance when the number of DMUs is quite small.

Decision Science LettersVol. 15(2)
Life in Land
Openalex Percentile: Top 0%
Efficiency Analysis Using DEA
58.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.