-
I'm curious to know if stumpy can find near matches that have some configurable amount of temporal distortion/warping. Is this something that stumpy is able to identify, or does it need to be a near perfect match in time? |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 1 reply
-
@jefferyanderson Thank you for your question and welcome to the STUMPY community. I don't think there's an easy answer and the pragmatic thing to do is to just "try and see". Sometimes, matrix profiles may be sufficient for the job and, other times, maybe not. What you are referring to is likely related to applying some sort of "Dynamic Time Warping" (DTW). The original matrix profile researchers are experts on this and have written a follow up paper (that we have an open issue on) that aims to combine DTW and matrix profiles. Additionally, there is a recent paper that also tries to address this "variance in subsequence length" but, frankly, this is just a REALLY hard problem to solve. Needing to account for distortion/warping adds an additional (nasty) layer of computational complexity that makes it viable only for small toy datasets and nearly impractical for anything larger than, say, 10K-50K data points. |
Beta Was this translation helpful? Give feedback.
@jefferyanderson Thank you for your question and welcome to the STUMPY community. I don't think there's an easy answer and the pragmatic thing to do is to just "try and see". Sometimes, matrix profiles may be sufficient for the job and, other times, maybe not.
What you are referring to is likely related to applying some sort of "Dynamic Time Warping" (DTW). The original matrix profile researchers are experts on this and have written a follow up paper (that we have an open issue on) that aims to combine DTW and matrix profiles. Additionally, there is a recent paper that also tries to address this "variance in subsequence length" but, frankly, this is just a REALLY hard problem to solve. Ne…