Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...
Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...
Xiao Liu PhD Thesis.pdf - Faculty of Information and Communication ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
ecognition. Sliding Window ranks in the second place, but since it lacks the ability<br />
<strong>of</strong> looking backwards, it tends to over segment when the system performance is<br />
stable (i.e. the number <strong>of</strong> segments is small) such as the test cases <strong>of</strong> 11, 33, 48 <strong>and</strong><br />
53. Bottom-Up ranks the third place but since it lacks the ability <strong>of</strong> splitting, it tends<br />
to over segment when the system performance is dynamic such as the test cases <strong>of</strong><br />
12, 20, 47 <strong>and</strong> 76. When the system performance is less dynamic (e.g. the number <strong>of</strong><br />
segments is around 4 to 5 as depicted in Figure 4.5, its performance is close to that<br />
<strong>of</strong> Sliding Window. Top-Down behaves the worst in most cases due to its nature for<br />
over-segmenting. Since the only action for Top-Down is splitting <strong>and</strong> it stops the<br />
segmentation process as long as the testing criterion is met, Top-Down ignores the<br />
probability <strong>of</strong> merging small segments into large ones. Therefore, Top-Down<br />
usually has more segments than others.<br />
Before we demonstrate the comparison results on the accuracy <strong>of</strong> interval<br />
forecasting, we briefly review the 6 representative forecasting strategies <strong>and</strong><br />
introduce the setting <strong>of</strong> their parameters. Here, the actual value <strong>of</strong> the k th point is<br />
denoted as Y k <strong>and</strong> the predicted value for the k th point is denoted as P k . The length<br />
<strong>of</strong> the latest duration sequence is r<strong>and</strong>omly selected from 4 to 8.<br />
1) LAST. LAST takes the last value <strong>of</strong> the time series as the predicted value for<br />
the next point. Therefore, Formula 4.3 for LAST is defined as follows:<br />
P k = Y k −1 ( ≥ 1<br />
k ) Formula 4.3<br />
In the experiments, LAST takes the last point <strong>of</strong> the latest duration sequence as<br />
the predicted value.<br />
2) MEAN. MEAN takes the mean value <strong>of</strong> all its previous points as the predicted<br />
value for the next point. Therefore, Formula 4.4 for LAST is defined as follows:<br />
1 k −1<br />
i=<br />
0<br />
P k = ∑Y i ( k ≥ 1) Formula 4.4<br />
k<br />
In the experiments, MEAN takes the mean value <strong>of</strong> the entire time series where<br />
the latest duration sequence belongs to.<br />
3) Exponential Smoothing (ES). ES makes the prediction for the next value<br />
based on both the actual value <strong>and</strong> the predicted value <strong>of</strong> its previous point. ES does<br />
not react directly to peaks while it reacts fast enough to significant changes <strong>of</strong> the<br />
mean values (e.g. the changes from one segment to another segment). The parameter<br />
63