fpop: Segmentation using Optimal Partitioning and Function Pruning
A dynamic programming algorithm for the fast segmentation of univariate signals into piecewise constant profiles.
The 'fpop' package is a wrapper to a C++ implementation of the fpop (Functional Pruning Optimal Partioning) algorithm described in Maidstone et al. 2017
<doi:10.1007/s11222-016-9636-3>. The problem of detecting changepoints in an univariate sequence is formulated
in terms of minimising the mean squared error over segmentations. The fpop algorithm exactly minimizes the mean squared error
for a penalty linear in the number of changepoints.
| Version: |
2019.08.26 |
| Published: |
2019-08-27 |
| Author: |
Guillem Rigaill [aut, cre],
Toby Hocking [aut],
Robert Maidstone [aut],
Michel Koskas [ctb],
Paul Fearnhead [aut] |
| Maintainer: |
Guillem Rigaill <guillem.rigaill at inra.fr> |
| License: |
LGPL-2.1 | LGPL-3 [expanded from: LGPL (≥ 2.1)] |
| NeedsCompilation: |
yes |
| Citation: |
fpop citation info |
| Materials: |
NEWS |
| CRAN checks: |
fpop results |
Documentation:
Downloads:
Reverse dependencies:
Linking:
Please use the canonical form
https://CRAN.R-project.org/package=fpop
to link to this page.