Data Envelopment Analysis (DEA) in Massive Data Sets

  • Dulá J
  • López F
N/ACitations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data Envelopment Analysis (DEA) is a clustering methodology for records in data sets corresponding to entities sharing a common list of attributes. Broadly defined, DEA partitions the records into two subsets; those 'efficient' and those 'inefficient.' An efficient record is one which lies on a specific portion of the boundary of a finitely generated polyhedral set in the dimension of the attribute space known as the 'frontier'; inefficient points are those located elsewhere. In traditional applications, DEAfrontiers are nonparametric surrogates for unknown theoretical efficiency limits. More generally, however, frontiers are subsets of the boundary defined by extreme elements of the data set. This chapter deals with data envelopment analysis under this broader, more general, definition as it applies to large scale problems.

Cite

CITATION STYLE

APA

Dulá, J. H., & López, F. J. (2002). Data Envelopment Analysis (DEA) in Massive Data Sets (pp. 419–437). https://doi.org/10.1007/978-1-4615-0005-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free