We present hierarchical change-detection tests (HCDTs), as effective online algorithms for detecting changes in datastreams. HCDTs are characterized by a hierarchical architecture composed of a detection layer and a validation layer. The detection layer steadily analyzes the input datastream by means of an online, sequential CDT, which operates as a low-complexity trigger that promptly detects possible changes in the process generating the data. The validation layer is activated when the detection one reveals a change, and performs an offline, more sophisticated analysis on recently acquired data to reduce false alarms. Our experiments show that, when the process generating the datastream is unknown, as it is mostly the case in the real world, HCDTs achieve a far more advantageous tradeoff between false-positive rate and detection delay than their single-layered, more traditional counterpart. Moreover, the successful interplay between the two layers permits HCDTs to automatically reconfigure after having detected and validated a change. Thus, HCDTs are able to reveal further departures from the postchange state of the data-generating process.
|Titolo:||Hierarchical Change-Detection Tests|
|Autori interni:||ALIPPI, CESARE|
|Data di pubblicazione:||2017|
|Rivista:||IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS|
|Appare nelle tipologie:||01.1 Articolo in Rivista|
File in questo prodotto:
|2016_01_TNNLS_HierarchicalCDTs.pdf||1.21 MB||Adobe PDF||Post-print||Accesso riservato|