Skip to content

gfpop

1.1.2Package record

Graph-Constrained Functional Pruning Optimal Partitioning

0packages depend
341downloads / year
56.8%test coverage
13/13flavors OK

Overview

About

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. This includes quadratic Gaussian cost (type = 'mean'), log-linear cost (type = 'variance', 'poisson' or 'exp') and log-log cost (type = 'negbin'). More details in the paper published in the Journal of Statistical Software: doi:10.18637/jss.v106.i06.

Install

Health

CRAN checks
13OK
Slowest check: 5.4 min · r-release-macos-x86_64
Status changes
  • OK13 OKNow
  • OK6 OK2026-09-28
Advisories

none known

Documentation

In release 1.1.2
READMEYes · 861 wordsVignettesYes · 2 · dynamicNEWSNoCitation fileYes · cites a publicationWebsitenot declared in DESCRIPTION
Cites a JSS article
Help pages
16
Examples that run
100%10 run in a plain check
Exported functions with examples
91%
Documented parameters
100%
Return-value docs
100%
Help pages citing references
13%

Downloads

341
CRAN downloads in the past year
Rank #25,329 · ~1/day · ~28/mo
Daily download trend is not available in this view yet.
32530 days
32590 days
3411 year
Compare downloads with other packages →
Also on293 r2u4 autocran

Dependencies

Declared dependencies
8 external dependencies (excludes base and recommended)

Installing gfpop adds 1 package (1 with compiled code, 1.8 MB of source tarballs). Heaviest: Rcpp 1.8 MB.

Depends (1)
R >= 3.5.0
Imports (1)
LinkingTo (1)
Enhances (0)
none
Reverse dependencies
0direct
0indirect

Nothing depends on this yet.

Datasets

People & History

People (9)
Author, Maintainer since 1.0.0 (2020)
Author · added in 1.0.3
Contributor
Contributor
Releases (7)

Pick two releases to compare their code metrics.

  • unarchivedReturned to CRAN
    2026-09-27
  • 1.1.2Latest
    record
    2026-09-27 · current release · diff ↗
  • R
    R 4.6.0 released · 2026-04-24
  • R
    R 4.5.0 released · 2025-04-11
  • R
    R 4.4.0 released · 2024-04-24
  • archivedRemoved from CRAN
    2024-03-29
    policy violation On Internet access
  • R
    R 4.3.0 released · 2023-04-21
  • 1.1.1
    record
    2023-03-27 · diff ↗ ·
    added 2 exports
    print.gfpop, summary.gfpop
  • R
    R 4.2.0 released · 2022-04-22
  • 1.1.0
    record
    2022-03-10 · diff ↗
  • R
    R 4.1.0 released · 2021-05-18
  • 1.0.3
    record
    2021-02-17 · diff ↗
  • 1.0.2
    record
    2020-12-01 · diff ↗
  • 1.0.1
    record
    2020-11-30 · diff ↗
  • 1.0.0
    record
    2020-11-25
  • R
    R 4.0.0 released · 2020-04-24

Package metadata

First published
2020-11-25
Total releases
7 / 6 yrs
License
MIT + file LICENSE OSI
Minimum R
≥ 3.5.0
Bundled data
1.7 MB / 4 files
Download size
2.1 MB

Cite

Cite this package

Run in R for the authors' entry:

citation("gfpop")

The package provides a citation file, so citation() returns the authors' own entry.

It points to 10.18637/jss.v106.i06.

Cite the R Observatory

For a number measured here: a download total, a coverage figure, an archival date.

APA

Balamuta, J. J. (2026). R Observatory: Metrics for gfpop version 1.1.2 [Data set]. HJJB, LLC. Data release v2026-10-23. https://doi.org/10.5281/zenodo.21843040

From data release v2026-10-23, which the citation names so these numbers can be found later. More on citing and the projects behind them.

Report a problem with this page →

Privacy choices

These apply to this browser and are stored on this device only. Nothing about your choice is sent to us.

Read the privacy policy