Cost-Sensitive Learning by Cost-Proportionate Example Weighting

We propose and evaluate a family of methods for converting classifier learning algorithms and classification theory into cost-sensitive algorithms and theory. The proposed conversion is based on cost-proportionate weighting of the training examples, which can be realized either by feeding the weights to the classification algorithm (as often done in boosting), or by careful subsampling. We give some theoretical performance guarantees on the proposed methods, as well as empirical evidence that they are practical alternatives to existing approaches. In particular, we propose costing, a method based on cost-proportionate rejection sampling and ensemble aggregation, which achieves excellent predictive performance on two publicly available datasets, while drastically reducing the computation required by other methods.

• Type: Conference
• Year: 2003
• Where: ICDM
• Authors: Bianca Zadrozny, John Langford, Naoki Abe
• Keywords: Classifier Learning Algorithms, Cost-sensitive Algorithms, Data Mining, ICDM 2003, Theoretical Performance Guarantees