The paper introduces the concept of 'time series discords,' defined as subsequences of a longer time series that are maximally different from all other subsequences of that series.
Sources
- Finding the most unusual time series subsequence: algorithms and ... (dl.acm.org)
- https://link.springer.com/article/10.1007/s10115-006-0034-6 (link.springer.com)
- https://era.library.ualberta.ca/items/dc9470a2-2fc9-4a1d-b83a-20a277a2280e (era.library.ualberta.ca)
- https://www.researchgate.net/publication/4207682_HOT_SAX_Efficiently_finding_the_most_unusual_time_series_subsequence (researchgate.net)
- https://par.nsf.gov/servlets/purl/10286775 (par.nsf.gov)
- https://ieeexplore.ieee.org/document/7395686/ (ieeexplore.ieee.org)