gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection
In a world with data that change rapidly and abruptly, it is important to detect those changes accurately. In this paper we describe an R package implementing a generalized version of an algorithm recently proposed by Hocking, Rigaill, Fearnhead, and Bourque (2020) for penalized maximum likelihood...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Foundation for Open Access Statistics
2023-03-01
|
| Series: | Journal of Statistical Software |
| Subjects: | |
| Online Access: | https://www.jstatsoft.org/index.php/jss/article/view/4384 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850102311995572224 |
|---|---|
| author | Vincent Runge Toby Dylan Hocking Gaetano Romano Fatemeh Afghah Paul Fearnhead Guillem Rigaill |
| author_facet | Vincent Runge Toby Dylan Hocking Gaetano Romano Fatemeh Afghah Paul Fearnhead Guillem Rigaill |
| author_sort | Vincent Runge |
| collection | DOAJ |
| description |
In a world with data that change rapidly and abruptly, it is important to detect those changes accurately. In this paper we describe an R package implementing a generalized version of an algorithm recently proposed by Hocking, Rigaill, Fearnhead, and Bourque (2020) for penalized maximum likelihood inference of constrained multiple change-point models. This algorithm can be used to pinpoint the precise locations of abrupt changes in large data sequences. There are many application domains for such models, such as medicine, neuroscience or genomics. Often, practitioners have prior knowledge about the changes they are looking for. For example in genomic data, biologists sometimes expect peaks: up changes followed by down changes. Taking advantage of such prior information can substantially improve the accuracy with which we can detect and estimate changes. Hocking et al. (2020) described a graph framework to encode many examples of such prior information and a generic algorithm to infer the optimal model parameters, but implemented the algorithm for just a single scenario. We present the gfpop package that implements the algorithm in a generic manner in R/C++. gfpop works for a user-defined graph that can encode prior assumptions about the types of changes that are possible and implements several loss functions (Gauss, Poisson, binomial, biweight, and Huber). We then illustrate the use of gfpop on isotonic simulations and several applications in biology. For a number of graphs the algorithm runs in a matter of seconds or minutes for 105 data points.
|
| format | Article |
| id | doaj-art-e67e85b988e8481c9b7a577d7dff285d |
| institution | DOAJ |
| issn | 1548-7660 |
| language | English |
| publishDate | 2023-03-01 |
| publisher | Foundation for Open Access Statistics |
| record_format | Article |
| series | Journal of Statistical Software |
| spelling | doaj-art-e67e85b988e8481c9b7a577d7dff285d2025-08-20T02:39:47ZengFoundation for Open Access StatisticsJournal of Statistical Software1548-76602023-03-01106110.18637/jss.v106.i064148gfpop: An R Package for Univariate Graph-Constrained Change-Point DetectionVincent Runge0Toby Dylan Hocking1Gaetano Romano2Fatemeh Afghah3Paul Fearnhead4Guillem Rigaill5Université d'ÉvryNorthern Arizona UniversityLancaster UniversityClemson UniversityLancaster UniversityINRAE - Université d'Évry In a world with data that change rapidly and abruptly, it is important to detect those changes accurately. In this paper we describe an R package implementing a generalized version of an algorithm recently proposed by Hocking, Rigaill, Fearnhead, and Bourque (2020) for penalized maximum likelihood inference of constrained multiple change-point models. This algorithm can be used to pinpoint the precise locations of abrupt changes in large data sequences. There are many application domains for such models, such as medicine, neuroscience or genomics. Often, practitioners have prior knowledge about the changes they are looking for. For example in genomic data, biologists sometimes expect peaks: up changes followed by down changes. Taking advantage of such prior information can substantially improve the accuracy with which we can detect and estimate changes. Hocking et al. (2020) described a graph framework to encode many examples of such prior information and a generic algorithm to infer the optimal model parameters, but implemented the algorithm for just a single scenario. We present the gfpop package that implements the algorithm in a generic manner in R/C++. gfpop works for a user-defined graph that can encode prior assumptions about the types of changes that are possible and implements several loss functions (Gauss, Poisson, binomial, biweight, and Huber). We then illustrate the use of gfpop on isotonic simulations and several applications in biology. For a number of graphs the algorithm runs in a matter of seconds or minutes for 105 data points. https://www.jstatsoft.org/index.php/jss/article/view/4384change-point detectionconstrained inferencemaximum likelihood inferencedynamic programmingrobust losses |
| spellingShingle | Vincent Runge Toby Dylan Hocking Gaetano Romano Fatemeh Afghah Paul Fearnhead Guillem Rigaill gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection Journal of Statistical Software change-point detection constrained inference maximum likelihood inference dynamic programming robust losses |
| title | gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection |
| title_full | gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection |
| title_fullStr | gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection |
| title_full_unstemmed | gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection |
| title_short | gfpop: An R Package for Univariate Graph-Constrained Change-Point Detection |
| title_sort | gfpop an r package for univariate graph constrained change point detection |
| topic | change-point detection constrained inference maximum likelihood inference dynamic programming robust losses |
| url | https://www.jstatsoft.org/index.php/jss/article/view/4384 |
| work_keys_str_mv | AT vincentrunge gfpopanrpackageforunivariategraphconstrainedchangepointdetection AT tobydylanhocking gfpopanrpackageforunivariategraphconstrainedchangepointdetection AT gaetanoromano gfpopanrpackageforunivariategraphconstrainedchangepointdetection AT fatemehafghah gfpopanrpackageforunivariategraphconstrainedchangepointdetection AT paulfearnhead gfpopanrpackageforunivariategraphconstrainedchangepointdetection AT guillemrigaill gfpopanrpackageforunivariategraphconstrainedchangepointdetection |