Fast fuzzy subsequence matching algorithms on time-series

作者：

Highlights：

• Several techniques are used to accelerate computational time.

• R*-tree is adopted to further prune unnecessary computations.

• Three fuzzy subsequence matching algorithms are compared.

• Experiments are conducted on synthetic and real data set.

摘要

•Several techniques are used to accelerate computational time.•R*-tree is adopted to further prune unnecessary computations.•Three fuzzy subsequence matching algorithms are compared.•Experiments are conducted on synthetic and real data set.

论文关键词：Time-series,Subsequence matching,Fuzzy subsequence matching,IFSM-R*,IFSM-kd

论文评审过程：Received 10 June 2018, Revised 3 September 2018, Accepted 5 September 2018, Available online 5 September 2018, Version of Record 21 September 2018.

论文官网地址：https://doi.org/10.1016/j.eswa.2018.09.011