sktime/sktime

[ENH] minimal episode length smoother for segmentations and change points

Open

#6.751 aberto em 11 de jul. de 2024

Ver no GitHub
 (8 comments) (0 reactions) (0 assignees)Python (1.192 forks)batch import
enhancementgood first issueimplementing algorithmsmodule:detection

Métricas do repositório

Stars
 (7.162 stars)
Métricas de merge de PR
 (Mesclagem média 26d 10h) (86 fundiu PRs em 30d)

Description

Suggested estimator for time series annotation - changepoints and segments.

The algorithm is simple and ensures that episodes, i.e., segments, or time differences between change points, are larger than a given minimum.

A simple algorithm proceeds as follows:

  1. for each segment: check whether length is smaller than min_length; if yes, merge with the next segment, and change labels to the majority of the two.
  2. repeat 1 until no too short segments are found

This is just one possible strategy to do this, another one proceeds as follows:

Loop over segments, shortest first. For each segment, if too short, split in the middle and merge with adjacent segments. Update ordering of lengths each time this is done, until no too short segments remain.

The syntax would be that of a compositor: EnsureMinLengthSegments(my_annotator, strategy="strategyname")

Guia do colaborador