All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S2-T3.1
Paper Title Robust Quickest Change Detection in Statistically Periodic Processes
Authors Taposh Banerjee, Ahmad Taha, Eugene John, University of Texas at San Antonio, United States
Session D1-S2-T3: Quickest Change Detection
Chaired Session: Monday, 12 July, 22:20 - 22:40
Engagement Session: Monday, 12 July, 22:40 - 23:00
Abstract The problem of detecting a change in the distribution of a statistically periodic process is investigated. The problem is posed in the framework of independent and periodically identically distributed (i.p.i.d.) processes, a recently introduced class of processes to model statistically periodic data. An algorithm is proposed that is shown to be robust against an uncertainty in the post-change law. The motivation for the problem comes from event detection problems in traffic data, social network data, electrocardiogram data, and neural data, where periodic statistical behavior has been observed.