Home > Research > Publications & Outputs > A computationally efficient, high-dimensional m...

Electronic data

  • 2011.03599

    Rights statement: 12m

    Accepted author manuscript, 2.33 MB, PDF document

    Embargo ends: 1/01/50

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Text available via DOI:


View graph of relations

A computationally efficient, high-dimensional multiple changepoint procedure with application to global terrorism incidence

Research output: Contribution to journalJournal articlepeer-review

<mark>Journal publication date</mark>20/03/2021
<mark>Journal</mark>Journal of the Royal Statistical Society: Series A Statistics in Society
Publication StatusAccepted/In press
<mark>Original language</mark>English


Detecting changepoints in datasets with many variates is a data science challenge of increasing importance. Motivated by the problem of detecting changes in the incidence of terrorism from a global terrorism database, we propose a novel approach to multiple changepoint detection in multivariate time series. Our method, which we call SUBSET, is a model-based approach which uses a penalised likelihood to detect changes for a wide class of parametric settings. We provide theory that guides the choice of penalties to use for SUBSET, and that shows it has high power to detect changes regardless of whether only a few variates or many variates change. Empirical results show that SUBSET out-performs many existing approaches for detecting changes in mean in Gaussian data; additionally, unlike these alternative methods, it can be easily extended to non-Gaussian settings such as are appropriate for modelling counts of terrorist events.