A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic

Figure 3

The scheme of Criterion 1 based on the statistic fluctuations within BSTcA. In terms of this criterion, the left or right-child node, that is, or , might be selected to be involved in the current search path; meanwhile the remaining one is discarded. Thereafter, an optimal path towards the potential abrupt change in is expected to be obtained from BSTcA, after binary search steps.