相关论文: On optimality of the Shiryaev-Roberts procedure fo…
For the classical continuous-time quickest change-point detection problem it is shown that the randomized Shiryaev-Roberts-Pollak procedure is asymptotically nearly minimax-optimal (in the sense of Pollak 1985) in the class of randomized…
We consider the simple changepoint problem setting, where observations are independent, iid pre-change and iid post-change, with known pre- and post-change distributions. The Shiryaev-Roberts detection procedure is known to be…
For the most popular sequential change detection rules such as CUSUM, EWMA, and the Shiryaev-Roberts test, we develop integral equations and a concise numerical method to compute a number of performance metrics, including average detection…
Several variations of the Shiryaev-Roberts detection procedure in the context of the simple changepoint problem are considered: starting the procedure at $R_0=0$ (the original Shiryaev-Roberts procedure), at $R_0=r$ for fixed $r>0$, and at…
We consider the quickest change-point detection problem in pointwise and minimax settings for general dependent data models. Two new classes of sequential detection procedures associated with the maximal "local" probability of a false alarm…
The problem of detecting a change in the drift of a Brownian motion is considered. The change point is assumed to have a modified exponential prior distribution with unknown parameters. A worst-case analysis with respect to these parameters…
Let \xi_0,\xi_1,...,\xi_{\omega-1} be observations from the hidden Markov model with probability distribution P^{\theta_0}, and let \xi_{\omega},\xi_{\omega+1},... be observations from the hidden Markov model with probability distribution…
The CUSUM procedure is known to be optimal for detecting a change in distribution under a minimax scenario, whereas the Shiryaev-Roberts procedure is optimal for detecting a change that occurs at a distant time horizon. As a simpler…
A weighted Shiryaev-Roberts change detection procedure is shown to approximately minimize the expected delay to detection as well as higher moments of the detection delay among all change-point detection procedures with the given low…
We consider a sequential Bayesian changepoint detection problem for a general stochastic model, assuming that the observed data may be dependent and non-identically distributed and the prior distribution of the change point is arbitrary,…
The gist of the quickest change-point detection problem is to detect the presence of a change in the statistical behavior of a series of sequentially made observations, and do so in an optimal detection-speed-vs.-"false-positive"-risk…
The paper addresses a sequential changepoint detection problem for a general stochastic model, assuming that the observed data may be non-i.i.d. (i.e., dependent and non-identically distributed) and the prior distribution of the change…
In 1960s Shiryaev developed Bayesian theory of change detection in independent and identically distributed (i.i.d.) sequences. In Shiryaev's classical setting the goal is to minimize an average detection delay under the constraint imposed…
Theory and algorithms are developed for detecting changes in the distribution of statistically periodic random processes. The statistical periodicity is modeled using independent and periodically identically distributed processes, a new…
In the 1960s, Shiryaev developed a Bayesian theory of change-point detection in the i.i.d. case, which was generalized in the beginning of the 2000s by Tartakovsky and Veeravalli for general stochastic models assuming a certain stability of…
For the problem of sequential detection of changes, we adopt the probability maximizing approach in place of the classical minimization of the average detection delay, and propose modified versions of the Shiryaev, Lorden and Pollak…
This paper investigates change point detection in state space models, in which the pre-change distribution $f^{\theta_0}$ is given, while the poster distribution $f^{\theta}$ after change is unknown. The problem is to raise an alarm as soon…
Assume that there are multiple data streams (channels, sensors) and in each stream the process of interest produces generally dependent and non-identically distributed observations. When the process is in a normal mode (in-control), the…
This paper considers a sequence of random variables generated according to a common distribution. The distribution might undergo periods of transient changes at an unknown set of time instants, referred to as change-points. The objective is…
We consider the problem of efficient on-line anomaly detection in computer network traffic. The problem is approached statistically, as that of sequential (quickest) changepoint detection. A multi-cyclic setting of quickest change detection…