Corpus ID: 236429050

Max-Type and Sum-Type Procedures for Online Change-Point Detection in the Mean of High-Dimensional Data

@inproceedings{Li2021MaxTypeAS,
  title={Max-Type and Sum-Type Procedures for Online Change-Point Detection in the Mean of High-Dimensional Data},
  author={Jun Li},
  year={2021}
}
  • Jun Li
  • Published 2021
  • Mathematics
We propose two procedures to detect a change in the mean of high-dimensional online data. One is based on a max-type U-statistic and another is based on a sum-type U-statistic. Theoretical properties of the two procedures are explored in the high dimensional setting. More precisely, we derive their average run lengths (ARLs) when there is no change point, and expected detection delays (EDDs) when there is a change point. Accuracy of the theoretical results is confirmed by simulation studies… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 22 REFERENCES
Sequential multi-sensor change-point detection
  • Yao Xie, D. Siegmund
  • Mathematics, Computer Science
  • 2013 Information Theory and Applications Workshop (ITA)
  • 2013
We develop a mixture procedure to monitor parallel streams of data for a change-point that affects only a subset of them, without assuming a spatial structure relating the data streams to oneExpand
Sequential change-point detection based on nearest neighbors
  • H. Chen
  • Computer Science, Mathematics
  • The Annals of Statistics
  • 2019
We propose a new framework for the detection of change-points in online, sequential data analysis. The approach utilizes nearest neighbor information and can be applied to sequences of multivariateExpand
Numerical Comparison of CUSUM and Shiryaev–Roberts Procedures for Detecting Changes in Distributions
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 aExpand
Sequential Detection of a Change in a Normal Mean when the Initial Value is Unknown
Three stopping rules are proposed to detect a change in a normal mean, when the initial value of the mean is unknown but an estimate obtained from a training sample is available. AsymptoticExpand
Using the Generalized Likelihood Ratio Statistic for Sequential Detection of a Change-Point
We study sequential detection of a change-point using the generalized likelihood ratio statistic. For the special case of detecting a change in a normal mean with known variance, we giveExpand
On optimality of the Shiryaev-Roberts procedure for detecting a change in distribution
In 1985, for detecting a change in distribution, Pollak introduced a specific minimax performance metric and a randomized version of the Shiryaev-Roberts procedure where the zero initial condition isExpand
Sketching for sequential change-point detection
TLDR
Numerical examples demonstrate that the sketching procedure can approach the performance of a procedure that uses the original data, even when the post-change mean vector is not sparse. Expand
Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems
Abstract In the standard formulation of the quickest change-point detection problem, a sequence of observations, whose distribution changes at some unknown point in time, is available to a decisionExpand
Efficient scalable schemes for monitoring a large number of data streams
The sequential changepoint detection problem is studied in the context of global online monitoring of a large number of independent data streams. We are interested in detecting an occurring event asExpand
A two-sample test for high-dimensional data with applications to gene-set testing
We proposed a two sample test for means of high dimensional data when the data dimension is much larger than the sample size. The classical Hotelling's $T^2$ test does not work for this ``large p,Expand
...
1
2
3
...