.png){kind=icon}
返回
Big data efficiency analysis: Improved algorithms for data envelopment analysis involving large datasets
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105553.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In general, data sets are growing larger and larger, and handling related issues is topic of big data. Similar trends and tendencies are evident in data envelopment analysis (DEA). DEA is a well-known instrument for determining the efficiencies of decision-making units (DMUs), applying linear programming. Still, as we will show, DEA suffers notably from the curse of dimensionality. Therefore, we propose improved decomposition-based algorithms involving different termination criteria and multithreading to address this issue. For some of these criteria, we prove the convergence of the algorithm; to the best of our knowledge, we are the first to prove this. Ultimately, from a computational point of view, we study the performance of the new big data strategy by an extensive numerical analysis, thus demonstrating the algorithm's scalability.
Keyword:
Data envelopment analysis
Big data
Parallel processing
Strong efficient activities
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Structural and operational management of Turkish airports: a bootstrap data envelopment analysis of efficiency.png)
policy sciences
policy sciencesIF4.4
PREAI
分享收藏
查看更多内容