Computes the Pan-Matrix Profile (PMP) for the given time series.
a matrix or a vector of numeric.
a vector of the window sizes that will be evaluated. They will be rounded to the lower integer
and sorted. (Default is a sequence of 20 values from 10 to half data size).
a logical. If TRUE, every new computation will be plotted. (Default is FALSE).
a PMP object that may or not contain an upper bound value, and previous computed profiles. The function will
add new profiles, not replace. (Default is NULL).
an int. Number of workers for parallel. (Default is 1).
an int. See details. (Default is 2).
Returns a PMP object.
The work closest in spirit to ours is VALMOD. The idea of VALMOD is to compute the MP for the shortest length of interest, then use the information gleaned from it to guide a search through longer subsequence lengths, exploiting lower bounds to prune off some calculations. This idea works well for the first few of the longer subsequence lengths, but the lower bounds progressively weaken, making the pruning ineffective. Thus, in the five case studies they presented, the mean value of U/L was just 1.24. In contrast, consider that our termite example in Fig. 15 has a U/L ratio of 240, more than two orders of magnitude larger. Thus, VALMOD is perhaps best seen as finding motifs with some tolerance for a slightly (~25%) too short user-specified query length, rather than a true "motif-of-all-lengths" algorithm. Also note that apart from the shortest length, VALMOD only gives some information for the other lengths, unlike pmp, which contains exact distances for all subsequences of all lengths.
When just the data is provided, the exploration will be done using the default window_sizes that is a sequence
of 20 values between 10 and the half data size and the resulting object will have an upper_bound equals to Inf.
If an object is provided by the argument pmp_obj, this function will add more information to the resulting object,
never changing the values already computed.
verbose changes how much information is printed by this function; 0 means nothing, 1 means text, 2
adds the progress bar, 3 adds the finish sound.
Talk about upper bound and window sizes
upper_window will be set to Inf on new objects 1.1. upper_window will also be used for plot, and for discovery, it must not remove any existing data from the object
window_sizes is used for plot, it must not remove any mp inside the object 2.1. window_sizes tells the function what mp are stored, it may be updated with as.numeric(names(pmp))
the functions must be capable to handle the data without need to sort by window_size, but sort may be useful later(?)
# \donttest{
# Just compute
pan <- pmp(mp_gait_data)
#> step: 1/20 binary idx: 1 window: 10
#> step: 2/20 binary idx: 11 window: 242
#> step: 3/20 binary idx: 6 window: 126
#> step: 4/20 binary idx: 16 window: 358
#> step: 5/20 binary idx: 3 window: 56
#> step: 6/20 binary idx: 8 window: 172
#> step: 7/20 binary idx: 13 window: 289
#> step: 8/20 binary idx: 18 window: 405
#> step: 9/20 binary idx: 2 window: 33
#> step: 10/20 binary idx: 4 window: 79
#> step: 11/20 binary idx: 7 window: 149
#> step: 12/20 binary idx: 9 window: 196
#> step: 13/20 binary idx: 12 window: 265
#> step: 14/20 binary idx: 14 window: 312
#> step: 15/20 binary idx: 17 window: 382
#> step: 16/20 binary idx: 19 window: 428
#> step: 17/20 binary idx: 5 window: 103
#> step: 18/20 binary idx: 10 window: 219
#> step: 19/20 binary idx: 15 window: 335
#> step: 20/20 binary idx: 20 window: 452
# Compute the upper bound, than add new profiles
pan <- pmp_upper_bound(mp_gait_data)
pan <- pmp(mp_gait_data, pmp_obj = pan)
#> step: 1/11 binary idx: 1 window: 10
#> step: 2/11 binary idx: 6 window: 126
#> step: 3/11 binary idx: 3 window: 56
#> step: 4/11 binary idx: 9 window: 196
#> step: 5/11 binary idx: 2 window: 33
#> step: 6/11 binary idx: 4 window: 79
#> step: 7/11 binary idx: 7 window: 149
#> step: 8/11 binary idx: 10 window: 219
#> step: 9/11 binary idx: 5 window: 103
#> step: 10/11 binary idx: 8 window: 172
#> step: 11/11 binary idx: 11 window: 242
# }