oracleModelComplexity

Compute Oracle model complexity from paper of Cleynen et al.

Computes optimal changepoint models using the
Poisson likelihood for non-negative count data,
subject to the PeakSeg constraint:
the first change must be up, second change down, third change up, etc.
For more info about the models and algorithms,
read "Constrained Dynamic Programming and Supervised Penalty Learning
Algorithms for Peak Detection"
<https://jmlr.org/papers/v21/18-843.html> by TD Hocking et al.

Toby Hocking

PeakSegOptimal

Optimal Segmentation Subject to Up-Down Constraints

oracleModelComplexity function

<dl> <dt>bases</dt>
<dd>bases</dd> <dt>segments</dt>
<dd>segments</dd></dl>

Arguments

Toby Dylan Hocking &lt;toby.hocking@r-project.org&gt; [aut, cre]

Author

oracleModelComplexity — oracleModelComplexity

<dl>

 <dt>bases</dt>
<dd>bases</dd>

 <dt>segments</dt>
<dd>segments</dd>

</dl>

oracleModelComplexity: oracleModelComplexity

Description

Usage

Value

Arguments

Author