Constructing Ensembles from Data Envelopment Analysis

Published Online:https://doi.org/10.1287/ijoc.1060.0180

References

  • Ali K. M., Pazzani M. J. Error reduction through learning multiple descriptions. Machine Learn. (1996) 24:173–202CrossrefGoogle Scholar
  • Andersen P., Petersen N. A procedure for ranking efficient units in data envelopment analysis. Management Sci. (1993) 39:1261–264LinkGoogle Scholar
  • Banker R. D., Chanes A., Cooper W. W. Some models for estimating technical and scale inefficiencies in data envelopment analysis. Management Sci. (1984) 30:1078–1092LinkGoogle Scholar
  • Barber D., Dobkin P., Huhdanpaa H. The quickhull algorithm for convex hulls. ACM Trans. Math. Software (1996) 22:469–483CrossrefGoogle Scholar
  • Bauer E., Kohavi R. An empirical comparison of voting classification algorithms: Bagging, boosting, and variants. Machine Learn. (1999) 36:105–142CrossrefGoogle Scholar
  • Blake C., Merz C. UCI repository of machine learning database. (1998) . Technical report, Department of Information and Computer Science, University of California, Irvine, CAGoogle Scholar
  • Breiman L. Bagging predictors. Machine Learn. (1996a) 24:123–140CrossrefGoogle Scholar
  • Breiman L. Stacked regressions. Machine Learn. (1996b) 24:49–64CrossrefGoogle Scholar
  • Breiman L. Arcing classifiers. Ann. Statist. (1998) 26:801–849CrossrefGoogle Scholar
  • Breiman L. Random forests. Machine Learn. (2001) 45:5–32CrossrefGoogle Scholar
  • Charnes A., Cooper W. W., Rhodes E. Measuring the efficiency of decision making units. Eur. J. Oper. Res. (1978) 2:429–444CrossrefGoogle Scholar
  • Charnes A., Cooper W., Lewin A., Seiford L.Data Envelopment Analysis, Theory, Methodology and Applications (1997) (Kluwer Academic Publishers, Dordrecht, The Netherlands) Google Scholar
  • Clemen R. T. Combining forecasts: A review and annoted bibliography. Internat. J. Forecasting (1989) 5:559–583CrossrefGoogle Scholar
  • Coelli T. A guide to DEAP version 2.1: A data envelopment analysis (computer) program. (1996) . Technical report, Department of Operations Research, University of New England, Armidale, New South Wales, AustraliaGoogle Scholar
  • Cooper W., Seiford L., Zhu J.Handbook on Data Envelopment Analysis (2004) (Kluwer Academic Publishers, Boston, MA) CrossrefGoogle Scholar
  • Dietterich T. Machine learning research: Four current directions. AI Magazine (1997) 18:97–136Google Scholar
  • Dietterich T. Ensemble methods in machine learning. Multiple Classifier Systems (2000) 18:1–15CrossrefGoogle Scholar
  • Domingos P. Knowledge discovery via multiple models. Intelligent Data Anal. (1998) 2:187–202CrossrefGoogle Scholar
  • Fare R., Grosskopf S., Lovell C. A. K.Production Frontiers (1994) (Cambridge University Press, West Nyack, NY) Google Scholar
  • Freund Y., Shapire R. E. Experiments with a new boosting algorithm. Proc. Thirteenth National Conf. Machine Learn. (1996) 148–156Google Scholar
  • Grosskopf S., Kathy J., Hayes L., Taylor W., Weber L. Anticipating the consequences of school reform: A new use of DEA. Management Sci. (1999) 45:608–620LinkGoogle Scholar
  • Hansen L., Salamon P. Neural network ensembles. IEEE Trans. Pattern Anal. Machine Intelligence (1990) 12:993–1001CrossrefGoogle Scholar
  • Ishwaran H., James L. F., Sun J. Bayesian model selection in finite mixtures by marginal density decompositions. J. Amer. Statist. Assoc. (2001) 96:1316–1332CrossrefGoogle Scholar
  • Kiang Y. M. A comparative assessment of classification methods. Decision Support Systems (2003) 35:441–454CrossrefGoogle Scholar
  • Kim E., Kim W., Lee Y. Combination of multiple classifiers for the customer's purchase behavior prediction. Decision Support Systems (2003) 34:167–175CrossrefGoogle Scholar
  • Kim Y., Kim J., Jongwoo J. Convex hull machine for regression and classification. IEEE Conf. Data Mining (2002) Maebashi City, Japan:243–253Google Scholar
  • Kittler J., Roli F. Multiple classifier systems. Proc. 2nd Internat. Workshop on MCS (2001) Cambridge, UK(Springer-Verlag, Berlin, Germany) CrossrefGoogle Scholar
  • Kuncheva L.Combining Pattern Classifiers: Methods and Algorithms (2004) (Wiley, New York) CrossrefGoogle Scholar
  • Kuncheva L., Whitaker C. Measures of diversity in classifier ensembles. Machine Learn. (2003) 51:181–207CrossrefGoogle Scholar
  • Lane T. Position paper: Extensions of ROC analysis to multi-class domains. Proc. ICML-2000 Workshop on Cost-Sensitive Learn. (2000) (Stanford University, Palo Alto, CA) Google Scholar
  • LeBlanc M., Tibshirani R. Combining estimates in regression and classification. J. Amer. Statist. Assoc. (1996) 9:1641–1650Google Scholar
  • Mangasarian O. L. Mathematical programming in data mining. Data Mining and Knowledge Discovery J. (1997) 1:183–210CrossrefGoogle Scholar
  • Meade N., Islam T. Technological forecasting: Model selection, model stability, and combining models. Management Sci. (1998) 44:1115–1130LinkGoogle Scholar
  • Mojirsheibani M. Combining classifiers via discretization. J. Amer. Statist. Assoc. (1999) 94:600–609CrossrefGoogle Scholar
  • Morrison D. G., Schmittlein D. C. How many forecasters do you really have?: Mahalanobis provides the intuition for the surprising Clemens and Winkler result. Oper. Res. (1991) 39:519–523LinkGoogle Scholar
  • Olafsson S., Yang J. Scalable optimization-based feature selection. Proc. SIAM Workshop Discrete Math. Data Mining (2002) Arlington, VA:53–64Google Scholar
  • Opitz D., Maclin R. Popular ensemble methods: An empirical study. J. Artificial Intelligence Res. (1999) 11:169–198CrossrefGoogle Scholar
  • Padmanabhan B., Tuzhilin A. On the use of optimization for data mining: Theoretical interactions and eCRM opportunities. Management Sci. (2003) 49:1327–1342LinkGoogle Scholar
  • Papatla P., Zahedi M. Leveraging the strengths of choice models and neural networks: A multi-product comparative analysis. Decision Sci. (2002) 33:433–468CrossrefGoogle Scholar
  • Provost F., Fawcett T. Robust classification for imprecise environment. Machine Learn. (2001) 42:203–231CrossrefGoogle Scholar
  • Russell D. T., Adam E. E. An empirical evaluation of alternative forecasting combinations. Management Sci. (1987) 33:1267–1276LinkGoogle Scholar
  • Rust T. R., Simester D., Brodie R. J., Nilikant V. Model selection criteria: An investigation of relative accuracy, posterior probabilities, and combination of criteria. Management Sci. (1995) 41:322–333LinkGoogle Scholar
  • Seiford M. L., Zhu J. Profitability and marketability of the top 55 U.S. commercial banks. Management Sci. (1999) 45:1270–1288LinkGoogle Scholar
  • Soteriou A., Zenios S. A. Operations, quality, and profitability in the provision of banking services. Management Sci. (1999) 45:1221–1238LinkGoogle Scholar
  • Srinivasan A. Note on the location of optimal classifiers in n-dimensional ROC space. (1999) . Technical report, Department of Computer Science, Oxford University, Oxford, UKGoogle Scholar
  • Valentini G., Masulli F. Ensembles of learning machines. Lecture Notes in Computer Sciences (2002) 2486(Springer-Verlag, Berlin) 3–19CrossrefGoogle Scholar
  • Winkler R. L., Makridakis S. The combination of forecasts. J. Roy. Statist. Soc. (1983) 146:150–157CrossrefGoogle Scholar
  • Witten I., Frank E.Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations (1999) (Morgan Kaufman, San Francisco, CA) Google Scholar
  • Wolpert D., Macready W. G. No free lunch theorems for optimization. IEEE Trans. Evolutionary Comput. (1997) 1:67–82CrossrefGoogle Scholar
  • Xue M., Harker P. T. Customer efficiency: Concept and its impact on e-business management. J. Service Res. (2002) 4:253–267CrossrefGoogle Scholar
  • Zhu H., Beling P., Overstreet G. A Bayesian framework for the combination of classifier outputs. J. Oper. Res. Soc. (2002) 53:719–727CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.