In the streaming context, k-nearest neighbor (KNN) is the most convenient batch method. A sliding window is used to determine the KNN for a new instance that is not yet classified. It normally uses the 1,000 most recent instances for the sliding window. As the sliding window slides, it handles the concept drift, too.