2017 IEEE International Conference on Data Mining Workshops (ICDMW) 2017
DOI: 10.1109/icdmw.2017.44
|View full text |Cite
|
Sign up to set email alerts
|

Pruning and Nonparametric Multiple Change Point Detection

Abstract: Change point analysis is a statistical tool to identify homogeneity within time series data. We propose a pruning approach for approximate nonparametric estimation of multiple change points. This general purpose change point detection procedure 'cp3o' applies a pruning routine within a dynamic program to greatly reduce the search space and computational costs. Existing goodness-of-fit change point objectives can immediately be utilized within the framework.We further propose novel change point algorithms by ap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 22 publications
0
15
0
Order By: Relevance
“…Note that, we also investigated other changepoint algorithms such as binary segmentation and segment neighborhoods algorithms but PELT was selected for its superior performance. Similar to the segment neighborhood algorithm, PELT also provides an exact segmentation but due to its dynamic programming which incorporates a pruning step it has been shown to be more computationally efficient, resulting in substantial reduction in computational time …”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Note that, we also investigated other changepoint algorithms such as binary segmentation and segment neighborhoods algorithms but PELT was selected for its superior performance. Similar to the segment neighborhood algorithm, PELT also provides an exact segmentation but due to its dynamic programming which incorporates a pruning step it has been shown to be more computationally efficient, resulting in substantial reduction in computational time …”
Section: Methodsmentioning
confidence: 99%
“…Similar to the segment neighborhood algorithm, PELT also provides an exact segmentation but due to its dynamic programming which incorporates a pruning step it has been shown to be more computationally efficient, resulting in substantial reduction in computational time. [46][47][48][49][50] PELT employs a common approach of detecting changepoints through minimizing a cost function. For an ordered sequence of data z 1:n = (z 1 , … , z n ), PELT identifies s changepoints, 1:s = ( 1 , … , s ) that split the data into s + 1 segments with the ith segment containing z i−1 +1∶ i .…”
Section: Selection Threshold Optimized Empirically Via Splitting (Stomentioning
confidence: 99%
“…They are often associated with a likelihood or a ratio. Models may be distance based, such as similarity and dissimilarity distance [49], [50], fuzzy detection [51], kernel based rule methods and likelihood ratio methods.…”
Section: A Supervised Modelsmentioning
confidence: 99%
“…The motivation of this chapter is to describe a new approach to change-point detection in time series and demonstrate its application in the context of COVID-19 pandemic (analysis of geolocation tracking data, detection of changes in health data of patient etc.). Now, one of the most popular online statistical methods for solving such problems is the Kolmogorov-Smirnov test [6][7][8][9][10]. This non-parametric test is simple and effective when samples are not overlapping or they have small overlapping.…”
Section: Introductionmentioning
confidence: 99%