Installation
About
Given a likelihood provided by the user, this package applies it to a given matrix dataset in order to find change points in the data that maximize the sum of the likelihoods of all the segments. This package provides a handful of algorithms with different time complexities and assumption compromises so the user is able to choose the best one for the problem at hand. The implementation of the segmentation algorithms in this package are based on the paper by Bruno M. de Castro, Florencia Leonardi (2018)
github.com/thalesmello/segmentr |
Key Metrics
Downloads
Yesterday | 3 +50% |
Last 7 days | 15 -44% |
Last 30 days | 130 -16% |
Last 90 days | 403 -16% |
Last 365 days | 1.890 -0% |
Maintainer
Maintainer | Thales Mello |