CRAN/E | SBRect

SBRect

Detecting structural breaks using rectangle covering (non-parametric method)

Installation

About

The package uses fitting axes-aligned rectangles to a time series in order to find structural breaks. The algorithm enclose the time series in a number of axes-aligned rectangles and tries to minimize their area and number. As these are conflicting aims, the user has to specify a parameter alpha in [0.0,1.0]. Values close to 0 result in more breakpoints, values close to 1 in fewer. The left edges of the rectangles are the breakpoints. The package supplies two methods, computeBreakPoints(series,alpha) which returns the indices of the break points and computeRectangles(series,alpha) which returns the rectangles. The algorithm is randomised; it uses a genetic algorithm. Therefore, the break point sequence found can be different in different executions of the method on the same data, especially when used on longer series of some thousand observations. The algorithm uses a range-tree as background data structure which makes i very fast and suited to analyse series with millions of observations. A detailed description can be found in Paul Fischer, Astrid Hilbert, Fast detection of structural breaks, Proceedings of Compstat 2014.

www2.imm.dtu.dk/~pafi/StructBreak/index.html
System requirements java
Bug report File report

Key Metrics

Version 0.26
Published 2014-07-20 3620 days ago
Needs compilation? no
License GPL-2
CRAN checks SBRect results

Downloads

Yesterday 0
Last 7 days 2 0%
Last 30 days 9 -25%
Last 90 days 33 -57%
Last 365 days 203 -87%

Maintainer

Maintainer

Paul Fischer

Authors

Paul Fischer

aut / cre / cph

Astrid Hilbert

ctb / cph

Material

Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

r-oldrel

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Depends

rJava

Suggests

MASS