@inproceedings{d420f635bbdb45e4948cf2769366b02c,
title = "AIM: Approximate intelligent matching for time series data",
abstract = "Time-series data mining presents many challenges due to the intrinsic large scale and high dimensionality of the data sets. Sub-sequence similarity matching has been an active research area driven by the need to analyse large data sets in the financial, biomedical and scientific databases. In this paper, we investigate an intelligent subsequence similarity matching of time series queries based on effcient graph traversal. We introduce a new problem, the approximate partial matching of a query sequence in a time series database. Our system can address such queries with high specificity and minimal time and space overhead. The performance bottleneck of the current methods were analysed and we show our method can improve the performance of the time series queries significantly. It is general and exible enough to find the best approximate match query without specifying a tolerance {"} parameter.",
author = "Kim, {Edward D.} and Lam, {Joyce M.W.} and Jiawei Han",
year = "2000",
doi = "10.1007/3-540-44466-1_35",
language = "English (US)",
isbn = "3540679804",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "347--357",
editor = "Yahiko Kambayashi and Mukesh Mohania and Tjoa, {A. Min}",
booktitle = "Data Warehousing and Knowledge Discovery - 2nd International Conference, DaWaK 2000, Proceedings",
address = "Germany",
note = "2nd International Conference on Data Warehousing and Knowledge Discovery, DaWaK 2000 ; Conference date: 04-09-2000 Through 06-09-2000",
}