pith. sign in

arxiv: 1906.03001 · v1 · pith:CSTYWRPSnew · submitted 2019-06-07 · 📊 stat.ML · cs.LG· stat.ME

Online Graph-Based Change-Point Detection for High Dimensional Data

classification 📊 stat.ML cs.LGstat.ME
keywords detectiononlinechange-pointdataapproachchangegraph-basedgraph-spanning
0
0 comments X
read the original abstract

Online change-point detection (OCPD) is important for application in various areas such as finance, biology, and the Internet of Things (IoT). However, OCPD faces major challenges due to high-dimensionality, and it is still rarely studied in literature. In this paper, we propose a novel, online, graph-based, change-point detection algorithm to detect change of distribution in low- to high-dimensional data. We introduce a similarity measure, which is derived from the graph-spanning ratio, to test statistically if a change occurs. Through numerical study using artificial online datasets, our data-driven approach demonstrates high detection power for high-dimensional data, while the false alarm rate (type I error) is controlled at a nominal significant level. In particular, our graph-spanning approach has desirable power with small and multiple scanning window, which allows timely detection of change-point in the online setting.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.