The package implements Wild Binary Segmentation, a technique for consistent estimation of the number and locations of multiple change-points in data. It also provides a fast implementation of the standard Binary Segmentation algorithm.
The main routines of the package are
P. Fryzlewicz (2014), Wild Binary Segmentation for multiple change-point detection. Annals of Statistics, to appear. (http://stats.lse.ac.uk/fryzlewicz/wbs/wbs.pdf)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
#an example in which standard Binary Segmentation fails to detect change points x <- rnorm(300)+ c(rep(0,130),rep(-1,20),rep(1,20),rep(0,130)) s <- sbs(x) w <- wbs(x) s.cpt <- changepoints(s) s.cpt w.cpt <- changepoints(w) w.cpt # in this example, both algorithms work well x <- rnorm(300) + c(rep(1,50),rep(0,250)) s <- sbs(x) w <- wbs(x) s.cpt <- changepoints(s) s.cpt w.cpt <- changepoints(w) w.cpt
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.