Piecewise cloud approximation for time series mining

48Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many researchers focus on dimensionality reduction techniques for the efficient data mining in large time series database. Meanwhile, corresponding distance measures are provided for describing the relationships between two different time series in reduced space. In this paper, we propose a novel approach which we call piecewise cloud approximation (PWCA) to reduce the dimensionality of time series. This representation not only allows dimensionality reduction but also gives a new way to measure the similarity between time series well. Cloud, a qualitative and quantitative transformation model, is used to describe the features of subsequences of time series. Furthermore, a new way to measure the similarity between two cloud models is defined by an overlapping area of their own expectation curves. We demonstrate the performance of the proposed representation and similarity measure used in time series mining tasks, including clustering, classification and similarity search. The results of experiments indicate that PWCA is an effective representation for time series mining. © 2010 Published by Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Li, H., & Guo, C. (2011). Piecewise cloud approximation for time series mining. Knowledge-Based Systems, 24(4), 492–500. https://doi.org/10.1016/j.knosys.2010.12.008

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free