Article ID: | iaor20071048 |
Country: | Germany |
Volume: | 1 |
Issue: | 3/4 |
Start Page Number: | 231 |
End Page Number: | 244 |
Publication Date: | Oct 2004 |
Journal: | Computational Management Science |
Authors: | Velikova Marina, Daniels Hennie |
Keywords: | datamining |
In economic decision problems such as credit loan approval or risk analysis, models are required to be monotone with respect to the decision variables involved. Also in hedonic price models it is natural to impose monotonicity constraints on the price rule or function. If a model is obtained by a ‘unbiased search’ through the data, it mostly does not have this property even if the underlying database is monotone. In this paper, we present methods to enforce monotonicity of decision trees for price prediction. Measures for the degree of monotonicity of data are defined and an algorithm is constructed to make non-monotone data sets monotone. It is shown that monotone data truncated with noise can be restored almost to the original data by applying this algorithm. Furthermore, we demonstrate in a case study on house prices that monotone decision trees derived from cleaned data have significantly smaller prediction errors than trees generated using raw data.