Handling Generalized Cost Functions in the Partitioning Optimization Problem through Sequential Binary Programming

  • Authors:
  • Alan S. Abrahams;Adrian Becker;Daniel Fleder;Ian C. MacMillan

  • Affiliations:
  • University of Pennsylvania;University of Pennsylvania;University of Pennsylvania;University of Pennsylvania

  • Venue:
  • ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a framework for cost-sensitive classification under a generalized cost function. By combining decision trees with sequential binary programming, we can handle unequal misclassification costs, constrained classification, and complex objective functions that other methods cannot. Our approach has two main contributions. First, it provides a new method for cost-sensitive classification that outperforms a traditional, accuracy-based method and some current cost-sensitive approaches. Second, and more important, our approach can handle a generalized cost function, instead of the simpler misclassification cost matrix to which other approaches are limited.