Cost-sensitive classification with respect to waiting cost

Extant multiple-cost-sensitive learning algorithms are usually designed for dealing with misclassification cost (MC) and test cost (TC) together. This paper outlines a new learning algorithm, called cost-time sensitive classification, designed for minimizing tangible costs (which includes TC and waiting cost (WC)) as well as maximizing the decrease of the intangible costs (also called MC). The proposed algorithm induces decision trees from training datasets with missing data, in which the costs are measured in different units. Firstly, a split criterion is proposed for building cost-time sensitive decision trees, aiming at possibly reducing the intangible cost. Then a hybrid test strategy, which can handle missing values in test datasets, is designed for combining the sequential test with the batch test strategy. To evaluate the efficiency of the proposed method, extensive experiments were conducted on the UCI datasets at different missing rates. The experimental results show that the proposed algorithm achieves better than the existing ones in terms of reducing the intangible costs when taking into account waiting costs.