Boundary crossing probabilities for scan statistics and their applications to change-point detec\-tion (Q1398009): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1023510400300 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W70227274 / rank | |||
Normal rank |
Latest revision as of 11:03, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Boundary crossing probabilities for scan statistics and their applications to change-point detec\-tion |
scientific article |
Statements
Boundary crossing probabilities for scan statistics and their applications to change-point detec\-tion (English)
0 references
6 August 2003
0 references
A review of recent results in change-point detection and in the associated boundary crossing problems is given. Likelihood statistics (LR) are considered. The sequence of observed random variables \(X_1,\ldots,X_n,\ldots\) is supposed being a Markov chain, taking values in \(\mathbb R^d\). \(X_t\) have a common specified distribution density \(f_0\) for \(t<\nu\) and another common distribution \(f_1\) for \(t\geq \nu\). Defining \(\xi_i= \log (f_1(X_i| X_{i-1}) /f_0(X_i| X_{i-1}))\) and \(S_{n,k}=\sum_{i=k+1}^n\), the LR statistics \(\max_{0\leq k \leq n}\;(n-k)g (S_{n,k}/(n-k))\) are considered for some smooth functions \(g\). Large deviation approximations are given. Detection procedures which are not too demanding in computational and memory requirements are motivated.
0 references
Markov additive process
0 references
moving averages
0 references
large deviations
0 references
saddlepoint approximations
0 references
importance sampling
0 references