fastcpd
Fast Change Point Detection via Sequential Gradient Descent
Implements fast change point detection algorithm based on the paper "Sequential Gradient Descent and Quasi-Newton's Method for Change-Point Analysis" by Xianyang Zhang, Trisha Dawn https://proceedings.mlr.press/v206/zhang23b.html. The algorithm is based on dynamic programming with pruning and sequential gradient descent. It is able to detect change points a magnitude faster than the vanilla Pruned Exact Linear Time(PELT). The package includes examples of linear regression, logistic regression, Poisson regression, penalized linear regression data, and whole lot more examples with custom cost function in case the user wants to use their own cost function.
- Version0.14.6
- R version≥ 2.10
- LicenseGPL (≥ 3)
- Needs compilation?Yes
- fastcpd citation info
- Last release11/05/2024
Documentation
Team
Xingchi Li
Xianyang Zhang
Show author detailsRolesAuthor, Copyright holder
Insights
Last 30 days
Last 365 days
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
- Imports6 packages
- Suggests16 packages
- Linking To5 packages