• Corpus ID: 88524063

Change-point detection for multivariate and non-Euclidean data with local dependency

  title={Change-point detection for multivariate and non-Euclidean data with local dependency},
  author={Hao Chen},
  journal={arXiv: Methodology},
  • Hao Chen
  • Published 5 March 2019
  • Computer Science, Mathematics
  • arXiv: Methodology
In a sequence of multivariate observations or non-Euclidean data objects, such as networks, local dependence is common and could lead to false change-point discoveries. We propose a new way of permutation -- circular block permutation with a random starting point -- to address this problem. This permutation scheme is studied on a non-parametric change-point detection framework based on a similarity graph constructed on the observations, leading to a general framework for change-point detection… 

Figures and Tables from this paper

Asymptotic distribution-free change-point detection for multivariate and non-Euclidean data

We consider the testing and estimation of change-points, locations where the distribution abruptly changes, in a sequence of multivariate or non-Euclidean observations. We study a nonparametric

Weighted-Graph-Based Change Point Detection

The null limiting distribution is derived, accurate analytic approximations to control type I error are provided, and theoretical guarantees on the power consistency under contiguous alternatives for the one change point setting are established, as well as the minimax localization rate.

A review on minimax rates in change point detection and localisation.

  • Yi Yu
  • Computer Science
  • 2020
This paper starts with the univariate mean change point analysis problem and review the state-of-the-art results in the literature, then moves on to more complex data types and investigates general principles behind the optimal procedures that lead to minimax rate-optimal results.

A Universal Nonparametric Event Detection Framework for Neuropixels Data

It is hypothesized that neural activities underlying spontaneous behavior, though distributed brainwide, show evidences for network modularity, and the proposed framework to be a useful off-the-shelf analysis tool to the neuroscience community as new electrophysiological recording techniques continue to drive an explosive proliferation in the number and size of data sets.



Graph-based change-point detection

Simulations reveal that the new approach has better power than existing approaches when the dimension of the data is moderate to high, and is illustrated on two applications: the determination of authorship of a classic novel, and the detection of change in a network over time.

Resampling Methods for the Change Analysis of Dependent Data

The fundamental question in change-point analysis is whether an observed stochastic process follows one model or whether the underlying model changes at least once during the observational period.

Graph-Based Tests for Two-Sample Comparisons of Categorical Data

This work proposes a general non-parametric approach that utilizes similarity information on the space of all categories in two sample tests and explores different ways to extend graph-based tests to the categorical setting and found two types of statistics that are both powerful and fast to compute.

Break detection in the covariance structure of multivariate time series models

In this paper, we introduce an asymptotic test procedure to assess the stability of volatilities and cross-volatilites of linear and nonlinear multivariate time series models. The test is very

An exact distribution‐free test comparing two multivariate distributions based on adjacency

Summary.  A new test is proposed comparing two multivariate distributions by using distances between observations. Unlike earlier tests using interpoint distances, the new test statistic has a known

The Jackknife and the Bootstrap for General Stationary Observations

We extend the jackknife and the bootstrap method of estimating standard errors to the case where the observations form a general stationary sequence. We do not attempt a reduction to i.i.d. values.

An Introduction to Stein's Method

A common theme in probability theory is the approximation of complicated probability distributions by simpler ones, the central limit theorem being a classical example. Stein's method is a tool which

The Statistics of Gene Mapping

  • X. Qu
  • Mathematics
  • 2008
In Appendix A: List of Notations, the title is self-explanatory. This is a useful addition. Appendix B is devoted to matrix algebra topics that are not so likely to be found in standard texts but are


Pour des echantillons aleatoires independants: X 1 X 2 …X n1 distribue selon f(x) et Y 1 Y 2 …Y n2 distribue selon g(x) on presente un test qui possede les proprietes suivantes: la probabilite

Circular binary segmentation for the analysis of array-based DNA copy number data.

A modification ofbinary segmentation is developed, which is called circular binary segmentation, to translate noisy intensity measurements into regions of equal copy number in DNA sequence copy number.