DEA with streaming data

DEA can be interpreted as a tool for the identification of “frontier outliers” among data points. These are points that are potentially interesting because they exhibit extreme properties in that the values of their attributes, either alone or combined, are at the upper or lower limits of the data set to which they belong. A real challenge for this type of frontier analysis arises when data stream in at high rates and the DEA analysis needs to be performed quickly. This paper extends DEA into this dynamic data environment. The purpose is to propose a formal theoretical framework to handle streaming data and to answer the question of how fast data can be processed using this new framework. Potential applications involving large data sets include auditing, appraisals, fraud detection, and security. In such settings the situation is likely to be dynamic with the data domain constantly changing as new entities arrive in the course of time. New specialized tools to adapt DEA to deal with streaming data will be explored.

[1]  Ming-Fu Hsu,et al.  A hybrid approach of DEA, rough set and support vector machines for business failure prediction , 2010, Expert systems with applications.

[2]  Miin-Shen Yang,et al.  A new clustering approach using data envelopment analysis , 2009, Eur. J. Oper. Res..

[3]  Pekka J. Korhonen,et al.  A dimensional decomposition approach to identifying efficient units in large-scale DEA models , 2009, Comput. Oper. Res..

[4]  Josefsson Simon,et al.  Changes in productivity of Spanish university libraries , 2011 .

[5]  Sohyung Cho,et al.  Estimation of true efficient frontier of organisational performance using data envelopment analysis and support vector machine learning , 2011, Int. J. Inf. Decis. Sci..

[6]  Richard S. Barr,et al.  Parallel and hierarchical decomposition approaches for solving large-scale Data Envelopment Analysis models , 1997, Ann. Oper. Res..

[7]  William W. Cooper,et al.  Choosing weights from alternative optimal solutions of dual multiplier models in DEA , 2007, Eur. J. Oper. Res..

[8]  Hsihui Chang,et al.  Taiwan quality indicator project and hospital productivity growth , 2010, Omega.

[9]  José H. Dulá,et al.  Preprocessing DEA , 2009, Comput. Oper. Res..

[10]  José H. Dulá,et al.  A computational study of DEA with massive data sets , 2008, Comput. Oper. Res..

[11]  José H. Dulá An Algorithm for Data Envelopment Analysis , 2011, INFORMS J. Comput..

[12]  Jos H. Dul,et al.  Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron , 2006 .

[13]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[14]  José H. Dulá A geometrical approach for generalizing the production possibility set in DEA , 2009, J. Oper. Res. Soc..

[15]  José H. Dulá,et al.  A Computational Framework for Accelerating DEA , 2001 .

[16]  Pekka J. Korhonen,et al.  Using lexicographic parametric programming for identifying efficient units in DEA , 2007, Comput. Oper. Res..

[17]  Antreas D. Athanassopoulos,et al.  A Comparison of Data Envelopment Analysis and Artificial Neural Networks as Tools for Assessing the Efficiency of Decision Making Units , 1996 .

[18]  Joe Zhu,et al.  Measuring performance of two-stage network structures by DEA: A review and future perspective , 2010 .

[19]  Thomas Ottmann,et al.  Enumerating Extreme Points in Higher Dimensions , 2001, Nord. J. Comput..

[20]  Agha Iqbal Ali,et al.  Streamlined computation for data envelopment analysis , 1993 .