You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
loss has one column with various statistics about model complexity
(penalty, changes) and loss/cost.
cost has one row for each dynamic programming update (by default
equal to the number of data points but for visualizing how the
algorithm works at intermediate values you can use the n_updates
parameter).
cost_candidates is the cost of each candidate start position for
the last segment (used for the last dynamic programming update).
cost_optimal is the cost of the optimal model up to each data
point (W in the paper, computed via dynamic programming).
mean is the optimal last segment mean up to each data point (mu in
the paper, also computed during dynamic programming).
last_change is the optimal last change for the optimal model up to
each data point (tau^* in the paper, also computed during dynamic
programming).
changes has one row for each predicted changepoint position in the
optimal model (e.g. 1.5 means change between data points 1 and 2).
segments has one row for each predicted segment in the optimal
model.