Skip to content

Commit 08d2659

Browse files
committed
Updated docstring with "z-normalized"
1 parent 19db2a2 commit 08d2659

4 files changed

Lines changed: 10 additions & 10 deletions

File tree

stumpy/gpu_mpdist.py

Lines changed: 1 addition & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -11,9 +11,7 @@
1111

1212
def gpu_mpdist(T_A, T_B, m, percentage=0.05, k=None, device_id=0):
1313
"""
14-
Compute the non-normalized (i.e., without z-normalization) matrix profile distance
15-
(MPdist) measure between any two time series with one or more GPU devices and
16-
`stumpy.gpu_stump`.
14+
Compute the z-normalized matrix profile distance (MPdist) measure between any two time series with one or more GPU devices
1715
1816
The MPdist distance measure considers two time series to be similar if they share
1917
many subsequences, regardless of the order of matching subsequences. MPdist

stumpy/gpu_ostinato.py

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,8 @@
88

99
def gpu_ostinato(Ts, m, device_id=0):
1010
"""
11-
Find the consensus motif of multiple time series with one or more GPU devices
11+
Find the z-normalized consensus motif of multiple time series with one or more GPU
12+
devices
1213
1314
This is a wrapper around the vanilla version of the ostinato algorithm
1415
which finds the best radius and a helper function that finds the most

stumpy/mpdist.py

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -288,8 +288,8 @@ def _mpdist_vect(
288288

289289
def mpdist(T_A, T_B, m, percentage=0.05, k=None):
290290
"""
291-
Compute the matrix profile distance (MPdist) measure between any two time series
292-
with `stumpy.stump`.
291+
Compute the z-normalized matrix profile distance (MPdist) measure between any two
292+
time series
293293
294294
The MPdist distance measure considers two time series to be similar if they share
295295
many subsequences, regardless of the order of matching subsequences. MPdist
@@ -330,8 +330,8 @@ def mpdist(T_A, T_B, m, percentage=0.05, k=None):
330330

331331
def mpdisted(dask_client, T_A, T_B, m, percentage=0.05, k=None):
332332
"""
333-
Compute the matrix profile distance (MPdist) measure between any two time series
334-
with a distributed dask cluster and `stumpy.stumped`.
333+
Compute the z-normalized matrix profile distance (MPdist) measure between any two
334+
time series with a distributed dask cluster
335335
336336
The MPdist distance measure considers two time series to be similar if they share
337337
many subsequences, regardless of the order of matching subsequences. MPdist

stumpy/ostinato.py

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -245,7 +245,7 @@ def _ostinato(Ts, m, M_Ts, Σ_Ts, dask_client=None, device_id=None, mp_func=stum
245245

246246
def ostinato(Ts, m):
247247
"""
248-
Find the consensus motif of multiple time series
248+
Find the z-normalized consensus motif of multiple time series
249249
250250
This is a wrapper around the vanilla version of the ostinato algorithm
251251
which finds the best radius and a helper function that finds the most
@@ -309,7 +309,8 @@ def ostinato(Ts, m):
309309

310310
def ostinatoed(dask_client, Ts, m):
311311
"""
312-
Find the consensus motif of multiple time series with a distributed dask cluster
312+
Find the z-normalized consensus motif of multiple time series with a distributed
313+
dask cluster
313314
314315
This is a wrapper around the vanilla version of the ostinato algorithm
315316
which finds the best radius and a helper function that finds the most

0 commit comments

Comments
 (0)