Fast fuzzy subsequence matching algorithms on time-series

•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. Subsequence matching algorithms have many applications on t...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Expert systems with applications Jg. 116; S. 275 - 284
Hauptverfasser:	Gong, Xueyuan, Fong, Simon, Si, Yain-Whar
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.02.2019 Elsevier BV
Schlagworte:	Algorithms Euclidean geometry Fuzzy logic Fuzzy subsequence matching IFSM-kd IFSM-R Matching Neural networks Subsequence matching Time series IFSM-kd Fuzzy subsequence matching Time-series Subsequence matching IFSM-R
ISSN:	0957-4174, 1873-6793
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!