Name
Abstract | ||
|---|---|---|
The task of online change point detection in sensor data streams is often complicated due to presence of noise that can be mistaken for real changes and therefore affecting performance of change detectors. Most of the existing change detection methods assume that changes are independent from each other and occur at random in time. In this paper we study how performance of detectors can be improved in case of recurrent changes. We analytically demonstrate under which conditions and for how long recurrence information is useful for improving the detection accuracy. We propose a simple computationally efficient message passing procedure for calculating a predictive probability distribution of change occurrence in the future. We demonstrate two straightforward ways to apply the proposed procedure to existing change detection algorithms. Our experimental analysis illustrates the effectiveness of these approaches in improving the performance of a baseline online change detector by incorporating recurrence information. Read More: http://epubs.siam.org/doi/10.1137/1.9781611974348.62 |
Year | Venue | Field |
|---|---|---|
2016 | SDM | Data stream mining,Change detection,Computer science,Probability distribution,Artificial intelligence,Change detection algorithms,Detector,Message passing,Machine learning |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
6 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexandr V. Maslov | 1 | 0 | 0.68 |
| Mykola Pechenizkiy | 2 | 1655 | 125.40 |
| Indre Zliobaite | 3 | 354 | 25.13 |
| Tommi Kärkkäinen | 4 | 197 | 29.59 |