gfpop: Graph-Constrained Functional Pruning Optimal Partitioning

Penalized parametric change-point detection by functional pruning dynamic programming algorithm. The successive means are constrained using a graph structure with edges defining the nature of the changes These changes can be unconstrained (type std), up or down constrained (type up and down) or constrained by a minimal size jump (type abs). The type null means that the graph allows us to stay on the same segment. To each edge we can associate some additional properties: a minimal gap size, a penalty, some robust parameters (K,a) for biweight (K) and Huber losses (K and a). The user can also constrain the inferred means to lie between some minimal and maximal values. Data is modeled by a cost with possible use of a robust loss, biweight and Huber (see edge parameters K and a). These costs should have a quadratic, log-linear or a log-log representation.

Version: 1.1.0
Depends: R (≥ 3.5.0)
Imports: Rcpp (≥ 1.0.0)
LinkingTo: Rcpp
Suggests: devtools, knitr, data.table, testthat, rmarkdown, ggplot2, penaltyLearning
Published: 2022-03-10
Author: Vincent Runge [aut, cre], Toby Hocking [aut], Guillem Rigaill [aut], Daniel Grose [aut], Gaetano Romano [aut], Fatemeh Afghah [aut], Paul Fearnhead [aut], Michel Koskas [ctb], Arnaud Liehrmann [ctb]
Maintainer: Vincent Runge <vincent.runge at>
License: MIT + file LICENSE
NeedsCompilation: yes
SystemRequirements: C++11
CRAN checks: gfpop results


Reference manual: gfpop.pdf


Package source: gfpop_1.1.0.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): gfpop_1.1.0.tgz, r-oldrel (arm64): gfpop_1.1.0.tgz, r-release (x86_64): gfpop_1.1.0.tgz, r-oldrel (x86_64): gfpop_1.1.0.tgz
Old sources: gfpop archive


Please use the canonical form to link to this page.