Classification is a well-studied problem in data mining. Classification performance was originally gauged almost exclusively
using predictive accuracy, but as work in the field progressed, more sophisticated measures of classifier utility that better
represented the value of the induced knowledge were introduced. Nonetheless, most work still ignored the cost of acquiring
training examples, even though this cost impacts the total utility of the data mining
process. In this article we analyze the relationship between the number of acquired training examples and the utility of the data
mining process and, given the necessary cost information, we determine the number of training examples that yields the optimum
overall performance. We then extend this analysis to include the cost of model induction—measured in terms of the CPU time
required to generate the model. While our cost model does not take into account all possible costs, our analysis provides
some useful insights and a template for future analyses using more sophisticated cost models. Because our analysis is based
on experiments that acquire the full set of training examples, it cannot directly be used to find a classifier with optimal
or near-optimal total utility. To address this issue we introduce two progressive sampling strategies that are empirically
shown to produce classifiers with near-optimal total utility.
Keywords Data mining - Machine learning - Induction - Decision trees - Utility-based data mining - Cost-sensitive learning - Active learning
Responsible editor: Geoff Webb.