Time-series anomaly detection using dynamic programming based longest common subsequence on sensor data

Expert Systems with Applications(2023)

引用 4|浏览58
暂无评分
摘要
•Measure the similarity of two time-series based on the longest common subsequence (LCS).•Investigate a gap search constraint to limit the searching range to find the LCS.•Provide a threshold to define the matching of a pair of time-series.•Detect the anomalous time-series based on the similarity-based LCS.•Apply on a case study of big multisensory data.
更多
查看译文
关键词
Anomaly detection,Dynamic programming,Fixed gap longest common subsequence,Longest common subsequence,Time-series
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要