An Algorithm for Anticipating Future Decision Trees from Concept-Drifting Data

Concept-Drift is an important topic in practical (data mining. since it is reality in most business applications. Whenever a mining model is used in an application it is already outdated since the world has changed since the model induction. The solution is to predict the drift of a model and derive a future model based on such it prediction. One way would be to simulate future data and derive a model from it. but this is typically not feasible. Instead we suggest to predict the values of the measures that drive model induction. In particular, we propose to predict the future values of attribute Selection measures and class label distribution For the induction of decision trees. We give an example of how concept drift is reflected in the trend of these measures and that the resulting decision trees perform considerably better than the ones produced by existing approaches.