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

Table 4

The summary of abrupt change detection on .

M										Mean
		2^7	2^8	2^9	2^10	2^7	2^8	2^9	2^10
		25	50	100	200	100	200	400	900
e-CP	BSTKS	25	50	100	276	100	200	376	900	NA
	KS	29	36	95	206	34	92	301	795	NA
		24	255	31	1023	31	199	33	1023	NA
	SSA	32	55	398	1007	106	208	500	907	NA
Err	BSTKS	0	0	0	76	0	0	24	0	12.5
	KS	4	14	5	6	66	108	99	105	50.9
		1	205	69	823	69	1	367	123	207.3
	SSA	7	5	298	807	6	8	100	7	154.8
Acc	BSTKS	1.0	1.0	1.0	.93	1.0	1.0	.95	1.0	.98
	KS	.97	.94	.99	.99	.48	.57	.81	.89	.83
		.99	.20	.86	.20	.46	.99	.28	.88	.61
	SSA	.94	.97	.42	.21	.94	.97	.80	.99	.78
Time	BSTKS	.023	.031	0.034	.036	.028	.033	.035	.038	.032
	KS	.019	.021	.038	.049	.020	.029	.039	.052	.033
		.03	.063	.088	.170	.031	.050	.081	.174	.086
	SSA	.037	.071	.126	.239	.035	.065	.118	.245	.117