PeakSegDP

A quadratic time dynamic programming algorithm can be used to compute an approximate solution to the problem of finding the most likely changepoints with respect to the Poisson likelihood, subject to a constraint on the number of segments, and the changes which must alternate: up, down, up, down, etc. For more info read http://proceedings.mlr.press/v37/hocking15.html "PeakSeg: constrained optimal segmentation and supervised penalty learning for peak detection in count data" by TD Hocking et al, proceedings of ICML2015.

Last 30 days

This package has been downloaded 536 times in the last 30 days. This could be a paper that people cite without reading. Reaching the medium popularity echelon is no small feat! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 21 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 7,888 times in the last 365 days. Impressive! The kind of number that makes colleagues ask, 'How did you do it?' The day with the most downloads was Jul 21, 2024 with 75 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.