A burst change detection algorithm for data streams

Burst Change of probability distribution at any moment is an important characteristic in data streams. When it has happened, data mining algorithm must adapt itself to new probability distribution. So how to detect burst change in data streams is an important part of data stream mining. In this paper, we proposed an algorithm BCDADS to detect it by using hoeffding theorem and independent identical distribution central limit theorem. Theory and experiment indicated this algorithm can effectively detect burst change in data streams.