变化后分布未知的统计周期过程的最快变化检测
Quickest Change Detection in Statistically Periodic Processes with Unknown Post-Change Distribution
摘要:
算法被开发用于最快地检测统计周期过程中的变化。这些过程的统计特性是非平稳的,但在固定的时间间隔后重复。假设决策者知道变更前的法律,但变更后的法律是未知的。在这个框架中,三个家庭的问题进行了研究:鲁棒的最快变化检测,联合最快变化检测和分类,多时隙最快变化检测。在多时隙问题中,可能发生变化的时段内的确切时隙是未知的。每个问题提出了算法,并证明了他们每个人的精确最优或渐近最优的低虚警制度。所开发的算法,然后用于异常检测交通数据和心律失常检测和识别心电图(ECG)数据。仿真数据也证明了算法的有效性。
英文摘要:
Algorithms are developed for the quickest detection of a change in statistically periodic processes. These are processes in which the statistical properties are nonstationary but repeat after a fixed time interval. It is assumed that the pre-change law is known to the decision maker but the post-change law is unknown. In this framework, three families of problems are studied: robust quickest change detection, joint quickest change detection and classification, and multislot quickest change detection. In the multislot problem, the exact slot within a period where a change may occur is unknown. Algorithms are proposed for each problem, and either exact optimality or asymptotic optimal in the low false alarm regime is proved for each of them. The developed algorithms are then used for anomaly detection in traffic data and arrhythmia detection and identification in electrocardiogram (ECG) data. The effectiveness of the algorithms is also demonstrated on simulated data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。