Please use this identifier to cite or link to this item:
https://ruomo.lib.uom.gr/handle/7000/1203
Title: | PCA-based Time Series Similarity Search |
Authors: | Karamitopoulos, Leonidas Evangelidis, Georgios Dervos, Dimitris A. |
Editors: | Stahlbock, R. Crone, S. Lessmann, S. |
Type: | Book chapter |
Subjects: | FRASCATI::Natural sciences::Computer and information sciences |
Keywords: | Time Series Similarity Search Time Instance Multivariate Time Series Query Object |
Issue Date: | 2010 |
Volume: | 8 |
First Page: | 255 |
Last Page: | 276 |
Volume Title: | Data Mining |
Part of Series: | Annals of Information Systems |
Part of Series: | Annals of Information Systems |
Abstract: | We propose a novel approach in multivariate time series similarity search for the purpose of improving the efficiency of data mining techniques without substantially affecting the quality of the obtained results. Our approach includes a representation based on principal component analysis (PCA) in order to reduce the intrinsically high dimensionality of time series and utilizes as a distance measure a variation of the squared prediction error (SPE), a well-known statistic in the Statistical Process Control community. Contrary to other PCA-based measures proposed in the literature, the proposed measure does not require applying the computationally expensive PCA technique on the query. In this chapter, we investigate the usefulness of our approach in the context of query by content and 1-NN classification. More specifically, we consider the case where there are frequently arriving objects that need to be matched with the most similar objects in a database or that need to be classified into one of several pre-determined classes. We conduct experiments on four data sets used extensively in the literature, and we provide the results of the performance of our measure and other PCA-based measures with respect to classi- fication accuracy and precision/recall. Experiments indicate that our approach is at least comparable to other PCA-based measures and a promising option for similarity search within the data mining context. |
URI: | https://doi.org/10.1007/978-1-4419-1280-0_11 https://ruomo.lib.uom.gr/handle/7000/1203 |
ISBN: | 978-1-4419-1279-4 978-1-4419-1280-0 |
ISSN: | 1934-3221 1934-3213 |
Other Identifiers: | 10.1007/978-1-4419-1280-0_11 |
Appears in Collections: | Department of Applied Informatics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2010_AIS.pdf | 424,02 kB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License