Detecting possibly frequent change-points: Wild Binary Segmentation 2 and steepest-drop model selection

Fryzlewicz, Piotr ORCID: 0000-0002-9676-902X (2020) Detecting possibly frequent change-points: Wild Binary Segmentation 2 and steepest-drop model selection. Journal of the Korean Statistical Society, 49 (4). 1027 - 1070. ISSN 1226-3192

Text (Detecting possibly frequent change-points) - Accepted Version Download (2MB)

• Author

Abstract

Many existing procedures for detecting multiple change-points in data sequences fail in frequent-change-point scenarios. This article proposes a new change-point detection methodology designed to work well in both infrequent and frequent change-point settings. It is made up of two ingredients: one is “Wild Binary Segmentation 2” (WBS2), a recursive algorithm for producing what we call a ‘complete’ solution path to the change-point detection problem, i.e. a sequence of estimated nested models containing 0 , … , T- 1 change-points, where T is the data length. The other ingredient is a new model selection procedure, referred to as “Steepest Drop to Low Levels” (SDLL). The SDLL criterion acts on the WBS2 solution path, and, unlike many existing model selection procedures for change-point problems, it is not penalty-based, and only uses thresholding as a certain discrete secondary check. The resulting WBS2.SDLL procedure, combining both ingredients, is shown to be consistent, and to significantly outperform the competition in the frequent change-point scenarios tested. WBS2.SDLL is fast, easy to code and does not require the choice of a window or span parameter.

Item Type:	Article
Official URL:	https://www.springer.com/journal/42952
Additional Information:	© 2020 Korean Statistical Society
Divisions:	Statistics
Subjects:	H Social Sciences > HA Statistics Q Science > QA Mathematics
Date Deposited:	17 Feb 2020 10:21
Last Modified:	15 Nov 2024 20:51
URI:	http://eprints.lse.ac.uk/id/eprint/103430

Actions (login required)

View Item