Asymptotically Optimal Quickest Change Detection under a Nuisance Change

This paper considers the problem of quickest detection of a change in distribution where the signal may undergo both nuisance and critical changes. Our goal is to detect the critical change without raising a false alarm over the nuisance change. We formulate the quickest change detection (QCD) problem in the presence of a nuisance change following Lorden’s formulation. We propose a window-limited sequential change detection procedure based on the generalized likelihood ratio test statistic for the problem of QCD in which both nuisance and critical changes may occur. We derive a recursive update scheme for our proposed test statistic and show that our test is asymptotically optimal under mild technical conditions. We compare our proposed stopping rules with a naive 2-stage stopping time, which attempts to detect the changes using separate CuSum stopping procedures for the nuisance and critical changes. Simulations suggest that our proposed stopping time outperforms the naive 2-stage procedures.

[1]  C. Faloutsos,et al.  EVENT DETECTION IN TIME SERIES OF MOBILE COMMUNICATION GRAPHS , 2010 .

[2]  Hongjoong Kim,et al.  A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods , 2006, IEEE Transactions on Signal Processing.

[3]  Ehsan Ebrahimzadeh,et al.  Sequential detection of transient changes in stochastic systems under a sampling constraint , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[4]  Alexander G. Tartakovsky,et al.  Rapid Detection of Attacks in Computer Networks by Quickest Changepoint Detection Methods , 2014 .

[5]  Douglas C. Montgomery,et al.  Using Control Charts to Monitor Process and Product Quality Profiles , 2004 .

[6]  G. Lorden.  PROCEDURES FOR REACTING TO A CHANGE IN DISTRIBUTION , 1971 .

[7]  Tze Leung Lai,et al.  Information Bounds and Quick Detection of Parameter Changes in Stochastic Systems , 1998, IEEE Trans. Inf. Theory.

[8]  T. Lai.  Sequential changepoint detection in quality control and dynamical systems , 1995 .

[9]  M. Bauer,et al.  Digital change detection in forest ecosystems with remote sensing imagery , 1996 .

[10]  H. Vincent Poor,et al.  Quickest Detection in Cognitive Radio: A Sequential Change Detection Framework , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[11]  I. Nikiforov,et al.  Sequential Detection of Transient Changes , 2012 .

[12]  E. S. Page.  CONTINUOUS INSPECTION SCHEMES , 1954 .

[13]  Vito M. R. Muggeo,et al.  Efficient change point detection for genomic sequences of continuous measurements , 2011, Bioinform..

[14]  Taposh Banerjee,et al.  Quickest Change Detection , 2012, ArXiv.

[15]  D. Siegmund,et al.  Using the Generalized Likelihood Ratio Statistic for Sequential Detection of a Change-Point , 1995 .

[16]  Y. Mei.  Asymptotically optimal methods for sequential change-point detection , 2003 .

[17]  Vikram Krishnamurthy,et al.  Bayesian Sequential Detection With Phase-Distributed Change Time and Nonlinear Penalty—A POMDP Lattice Programming Approach , 2011, IEEE Transactions on Information Theory.

[18]  Nikhil Kundargi,et al.  A nonparametric sequential kolmogorov-smirnov test for transmit opportunity detection at the MAC layer , 2009, 2009 IEEE 10th Workshop on Signal Processing Advances in Wireless Communications.

[19]  G. Moustakides.  Optimal stopping times for detecting changes in distributions , 1986 .

[20]  Hoon Sohn,et al.  Structural Health Monitoring Using Statistical Process Control , 2000 .

[21]  Philip S. Yu,et al.  Review spam detection via temporal pattern discovery , 2012, KDD.

[22]  Ali Tajer,et al.  Quickest Search for a Change Point , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[23]  George V. Moustakides,et al.  Sequentially detecting transitory changes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[24]  Taposh Banerjee,et al.  Data-Efficient Minimax Quickest Change Detection With Composite Post-Change Distribution , 2015, IEEE Transactions on Information Theory.

[25]  Mohammed J. Zaki,et al.  ADMIT: anomaly-based data mining for intrusions , 2002, KDD.

[26]  David J. Hand,et al.  Statistical fraud detection: A review , 2002 .

[27]  Wee Peng Tay,et al.  Optimal sampling policy for quickest change detection , 2017, 2017 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[28]  Yap-Peng Tan,et al.  Video segmentation based on sequential change detection , 2004, 2004 IEEE International Conference on Multimedia and Expo (ICME) (IEEE Cat. No.04TH8763).

[29]  Shaofeng Zou,et al.  Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis , 2019, IEEE Transactions on Information Theory.

[30]  Vikram Krishnamurthy,et al.  Quickest Detection POMDPs With Social Learning: Interaction of Local and Global Decision Makers , 2010, IEEE Transactions on Information Theory.

[31]  M. Pollak.  Optimal Detection of a Change in Distribution , 1985 .

[32]  Wee Peng Tay,et al.  Quickest Change Detection Under a Nuisance Change , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[33]  Robert B. Randall,et al.  Rolling element bearing diagnostics using the Case Western Reserve University data: A benchmark study , 2015 .

[34]  Taposh Banerjee,et al.  Power system line outage detection and identification — A quickest change detection approach , 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).