A quadratic time dynamic programming algorithm
can be used to compute an approximate solution to the problem of
finding the most likely changepoints
with respect to the Poisson likelihood, subject
to a constraint on the number of segments, and the changes which must
alternate: up, down, up, down, etc. For more info read
|Author||Toby Dylan Hocking, Guillem Rigaill|
|Date of publication||2017-08-15 21:39:42 UTC|
|Maintainer||Toby Dylan Hocking <[email protected]>|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.