linearOP

a vector defining the data points (x[i], data[i])

data

the penalty for introducing a new segment

penalty

a boolean to impose a continuity constraint

An optimal partitioning algorithm with a linear fit for each segment

Optimal partitioning algorithm for change-in-slope problem with continuity constraint and a finite number of states. Some constraints can be enforced in the inference: isotonic, unimodal or smoothing. With the function slopeSN() (segment neighborhood) the number of segments to infer is fixed by the user and does not depend on a penalty value.

linearOP: linearOP

Description

Usage

Arguments