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.
- Version2019.08.26
- R versionunknown
- LicenseLGPL-2.1
- LicenseLGPL-3
- Needs compilation?Yes
- fpop citation info
- Last release08/27/2019
Documentation
Team
Guillem Rigaill
Toby Hocking
Show author detailsRolesAuthorMichel Koskas
Show author detailsRolesContributorPaul Fearnhead
Show author detailsRolesAuthorRobert Maidstone
Show author detailsRolesAuthor
Insights
Last 30 days
This package has been downloaded 286 times in the last 30 days. Enough downloads to make a small wave in the niche community. The curiosity is spreading! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 7 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 4,307 times in the last 365 days. That's enough downloads to impress a room full of undergrads. A commendable achievement indeed. The day with the most downloads was Jul 21, 2024 with 149 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Reverse Suggests1 package