作者
Yuu Morinaka, Masatoshi Yoshikawa, Toshiyuki Amagasa, Shunsuke Uemura
发表日期
2001/4/16
期刊
Proc. 5th PacificAisa Conf. on Knowledge Discovery and Data Mining
页码范围
51-60
简介
We propose a novel indexing structure, L-index, for searching similar patterns in large time sequences efficiently. L-index is a sequence of line segments which compactly approximates the original data sequence. A line segment is used to approximate a subsequence of the original data sequence until the accumulated error exceeds a threshold value. By scanning the L-index, we can quickly find approximate answers of similarity queries. An important feature of the L-index is that approximate answers are guaranteed to include exact answers. it does not produce false dismissal. Our experimental result shows that the L-index does not require much storage area and process similarity queries efficiently.
引用总数
学术搜索中的文章
Y Morinaka, M Yoshikawa, T Amagasa, S Uemura - Proc. 5th PacificAisa Conf. on Knowledge Discovery …, 2001