Discord Detection For A Process With A Predefined Interval Of Observations

It is very important to promptly detect the point-of-change of the behavior of a system. In this paper, two algorithms'- the algorithm of cumulative sums and median algorithm - are proposed for detecting the point. Unlike earlier algorithms, the schemes detect the point even when the distribution of the target process shifts before or after the point, and the detection is made in an interval of predefined length. We also develop analytical models predicting the probability of discord omission. The median algorithm allows simpler expression and easier use than the algorithm of cumulative sums. Moreover, it is proved to be applicable for a wide range of parameter values of the distribution. Computer simulation verifies the effectiveness of the proposed algorithms, and it reveals that the points are correctly detected with few false alarms for practical conditions. Also shifted distribution is of great advantage for finding discord.

[1]  M. Srivastava,et al.  Comparison of EWMA, CUSUM and Shiryayev-Roberts Procedures for Detecting a Shift in the Mean , 1993 .

[2]  David Assaf,et al.  A Dynamic Sampling Approach for Detecting a Change in Distribution , 1988 .

[3]  B. Yakir.  Dynamic sampling policy for detecting a change in distribution, with a probability bound on false alarm , 1996 .

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

[5]  Sangyeol Lee,et al.  Sequential estimation for the autocorrelations of linear processes , 1996 .

[6]  D. Siegmund,et al.  A diffusion process and its applications to detecting a change in the drift of Brownian motion , 1984 .

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

[8]  Eric V. Slud,et al.  OPTIMAL STOPPING OF SEQUENTIAL SIZE-DEPENDENT SEARCH , 1996 .

[9]  Eitan Greenshtein,et al.  Comparison of sequential experiments , 1996 .

[10]  Dean P. Foster,et al.  Estimation up to a Change-Point , 1993 .

[11]  Moshe Pollak,et al.  Optimality and Almost Optimality of Mixture Stopping Rules , 1978 .

[12]  Benjamin Yakir.  A lower bound on the ARL to detection of a change with a probability constraint on false alarm , 1996 .

[13]  Moshe Pollak,et al.  Detecting a Change of a Normal Mean by Dynamic Sampling with a Probability Bound on a False Alarm , 1993 .

[14]  Ya'acov Ritov,et al.  Dynamic Sampling Procedures for Detecting a Change in the Drift of Brownian Motion: A Non-Bayesian Model , 1989 .

[15]  D. Siegmund,et al.  APPROXIMATIONS TO THE EXPECTED SAMPLE SIZE OF CERTAIN SEQUENTIAL TESTS , 1975 .

[16]  L. Horváth,et al.  The Maximum Likelihood Method for Testing Changes in the Parameters of Normal Observations , 1993 .

[17]  H. Müller.  CHANGE-POINTS IN NONPARAMETRIC REGRESSION ANALYSIS' , 1992 .