WA::DTW identification dynamique
The packages dtw for R and dtw-python for Python provide the most complete, freely-available (GPL) implementation of Dynamic Time Warping-type (DTW) algorithms up to date.
DTW allows a system to compare two signals and look for similarities even if one is time-shifted from the other.
Nearest Neighbor DTW (NN-DTW)
(1)
Il semble y avoir des conditions que la série doit respecter pour être alignée avec celle de l'entraînement. Cela déterminera aussi quand commencer la série, tant pour l'entraînement que pour la réalité à reconnaître. J'ai l'impression que cela sera peut-être une des interactions que de pointer le début d'une séquence à surveiller.
Ce sont les restrictions 🚫 : (2)
1.Boundary condition: p1 = (1,1) and pK = (N,M). The starting and ending points of the warping path must be the first and the last points of aligned sequences.
2. Monotonicity condition: n1 ≤ n2 ≤ ... ≤ nK and m1 ≤ m2 ≤ ... ≤ mK. This condition preserves the time-ordering of points.
3. Step size condition: this criteria limits the warping path from long jumps (shifts in time) while aligning sequences. While this condition will be discussed in greater details in the Section 3, for now will use the basic step size condition formulated as pl+1 − pl ∈ {(1, 1), (1, 0), (0, 1)}.

Dynamic time warping (DTW) is a well-known technique to find an optimal alignment between two given (time-dependent) sequences under certain restrictions.
(2007). Dynamic Time Warping. In: Information Retrieval for Music and Motion. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74048-3_4
Dynamic time warping (DTW) is a time series alignment algorithm developed originally for speech recognition. It aims at aligning two sequences of feature vectors by warping the time axis iteratively until an optimal match (according to a suitable metrics) between the two sequences is found.
DTW allows a system to compare two signals and look for similarities even if one is time-shifted from the other.