Time Series Subsequence Matching Based on a Combination of PIP and Clipping

被引:0
|
作者
Nguyen, Thanh Son [1 ]
Duong, Tuan Anh [1 ]
机构
[1] Ho Chi Minh City Univ Technol, Fac Comp Sci & Engn, Ho Chi Minh City, Vietnam
来源
INTELLIGENT INFORMATION AND DATABASE SYSTEMS, ACIIDS 2011, PT I | 2011年 / 6591卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Subsequence matching is a non-trivial task in time series data mining. In this paper, we introduce our proposed approach for solving subsequence matching which is based on IPIP, our new method for time series dimensionality reduction. The IPIP method is a combination of PIP (Perceptually Important Points) method and clipping technique in order that the new method not only satisfies the lower bounding condition, but also provides a bit level representation for time series. Furthermore, we can make IPIP indexable by showing that a time series compressed by IPIP can be indexed with the support of Skyline index. Our experiments show that our IPIP method is better than PAA in terms of tightness of lower bound and pruning power, and in subsequence matching, IPIP with Skyline index can perform faster than PAA based on traditional R*-tree.
引用
收藏
页码:149 / 158
页数:10
相关论文
共 50 条
  • [21] Efficient processing of subsequence matching with the Euclidean metric in time-series databases
    Kim, SW
    Park, DH
    Lee, HG
    INFORMATION PROCESSING LETTERS, 2004, 90 (05) : 253 - 260
  • [22] Fast normalization-transformed subsequence matching in time-series databases
    Moon, Yang-Sae
    Kim, Jinho
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (12) : 2007 - 2018
  • [23] An approach for fast subsequence matching through KMP algorithm in time series databases
    Li, AJ
    Liu, YH
    Qi, YJ
    Luo, SW
    2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 1292 - 1295
  • [24] Efficient moving average transform-based subsequence matching algorithms in time-series databases
    Moon, Yang-Sae
    Kim, Jinho
    INFORMATION SCIENCES, 2007, 177 (23) : 5415 - 5431
  • [25] Using multiple indexes for efficient subsequence matching in time-series databases
    Lim, Seung-Hwan
    Park, Heejin
    Kim, Sang-Wook
    INFORMATION SCIENCES, 2007, 177 (24) : 5691 - 5706
  • [26] NSPRING: Normalization-supported SPRING for Subsequence Matching on Time Series Streams
    Gong, Xueyuan
    Si, Yain-Whar
    Fong, Simon
    Mohammed, Sabah
    2014 IEEE 15TH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND INFORMATICS (CINTI), 2014, : 373 - 378
  • [27] Scalable data series subsequence matching with ULISSE
    Linardi, Michele
    Palpanas, Themis
    VLDB JOURNAL, 2020, 29 (06): : 1449 - 1474
  • [28] Using multiple indexes for efficient subsequence matching in time-series databases
    Lim, Seung-Hwan
    Park, Hee-Jin
    Kim, Sang-Wook
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PROCEEDINGS, 2006, 3882 : 65 - 79
  • [29] Pitch based Vehicle Localization using Time Series Subsequence Matching with Multi-scale Extrema Features
    Vemulapalli, Pramod K.
    Dean, Adam J.
    Brennan, Sean N.
    2011 AMERICAN CONTROL CONFERENCE, 2011, : 2405 - 2410
  • [30] Interactive and space-efficient multi-dimensional time series subsequence matching
    Piatov, Danila
    Helmer, Sven
    Dignos, Anton
    Gamper, Johann
    INFORMATION SYSTEMS, 2019, 82 : 121 - 135