The Algorithm APT to Classify in Concurrence of Latency and Drift

Population drift is a challenging problem in classification, and denotes changes in probability distributions over time. Known drift-adaptive classification methods such as incremental learning rely on current, labelled data for classification model updates, assuming that such labelled data are available without verification latency. However, verification latency is a relevant problem in some application domains, where predictions have to be made far into the future. This concurrence of drift and latency requires new approaches in machine learning. We propose a two-stage learning strategy: First, the nature of drift in temporal data needs to be identified. This requires the formulation of explicit drift models for the underlying data generating process. In a second step, these models are used to substitute scarce labelled data for updating classification models.

This paper contributes an explicit drift model, which is characterising a mixture of independently evolving sub-populations. In this model, the joint distribution is a mixture of arbitrarily distributed sub-populations drifting over time. An

a

rbitrary sub-

p

opulation

t

racker algorithm is presented, which can track and predict the distributions by the use of

unlabelled

data. Experimental evaluation shows that the presented

APT

algorithm is capable of tracking and predicting changes in the posterior distribution of class labels accurately.