{"title":"An Improvement of PIP for Time Series Dimensionality Reduction and Its Index Structure","authors":"N. T. Son, D. T. Anh","doi":"10.1109/KSE.2010.8","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a new time series dimensionality reduction method, IPIP. This method takes full advantages of PIP (Perceptually Important Points) method, proposed by Chung et al., with some improvements in order that the new method can theoretically satisfy the lower bounding condition for time series dimensionality reduction methods. Furthermore, we can make IPIP index able by showing that a time series compressed by IPIP can be indexed with the support of a multidimensional index structure based on Skyline index. Our experiments show that our IPIP method with its appropriate index structure can perform better than to some previous schemes, namely PAA based on traditional R*- tree.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Knowledge and Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KSE.2010.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
In this paper, we introduce a new time series dimensionality reduction method, IPIP. This method takes full advantages of PIP (Perceptually Important Points) method, proposed by Chung et al., with some improvements in order that the new method can theoretically satisfy the lower bounding condition for time series dimensionality reduction methods. Furthermore, we can make IPIP index able by showing that a time series compressed by IPIP can be indexed with the support of a multidimensional index structure based on Skyline index. Our experiments show that our IPIP method with its appropriate index structure can perform better than to some previous schemes, namely PAA based on traditional R*- tree.
本文介绍了一种新的时间序列降维方法——IPIP。该方法充分利用了Chung等人提出的PIP (perceptional Important Points)方法,并进行了一些改进,使得该方法在理论上能够满足时间序列降维方法的下边界条件。此外,通过展示IPIP压缩的时间序列可以在基于Skyline索引的多维索引结构的支持下进行索引,从而使IPIP索引成为可能。实验结果表明,采用适当的索引结构的IPIP方法比传统的基于R*-树的PAA方法具有更好的性能。