Sequential Change-point Detection for High-dimensional and non-Euclidean Data

by   Lynna Chu, et al.

In many modern applications, high-dimensional/non-Euclidean data sequences are collected to study complicated phenomena over time and it is of scientific importance to detect anomaly events as the data are being collected. We studied a nonparametric framework that utilizes nearest neighbor information among the observations and can be applied to such sequences. We considered new test statistics under this framework that can make more positive detections and can detect anomaly events sooner than the existing test under many common scenarios with the false discovery rate controlled at the same level. Analytic formulas for approximate the average run lengths of the new approaches are derived to make them fast applicable to large datasets.


page 1

page 2

page 3

page 4


A Fast and Efficient Change-point Detection Framework for Modern Data

Change-point analysis is thriving in this big data era to address proble...

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

In a sequence of multivariate observations or non-Euclidean data objects...

Evaluation of investigational paradigms for the discovery of non-canonical astrophysical phenomena

Non-canonical phenomena - defined here as observables which are either i...

Asymptotic distribution-free change-point detection for data with repeated observations

In the regime of change-point detection, a nonparametric framework based...

From Data to the p-Adic or Ultrametric Model

We model anomaly and change in data by embedding the data in an ultramet...

Graph-Based Two-Sample Tests for Discrete Data

In the regime of two-sample comparison, tests based on a graph construct...

A new classification framework for high-dimensional data

Classification is a classic problem but encounters lots of challenges wh...

Please sign up or login with your details

Forgot password? Click here to reset