An Adaptive Density-Based Time Series Clustering Algorithm: A Case Study on Rainfall Patterns

4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Current time series clustering algorithms fail to effectively mine clustering distribution characteristics of time series data without sufficient prior knowledge. Furthermore, these algorithms fail to simultaneously consider the spatial attributes, non-spatial time series attribute values, and non-spatial time series attribute trends. This paper proposes an adaptive density-based time series clustering (DTSC) algorithm that simultaneously considers the three above-mentioned attributes to relieve these limitations. In this algorithm, the Delaunay triangulation is first utilized in combination with particle swarm optimization (PSO) to adaptively obtain objects with similar spatial attributes. An improved density-based clustering strategy is then adopted to detect clusters with similar non-spatial time series attribute values and time series attribute trends. The effectiveness and efficiency of the DTSC algorithm are validated by experiments on simulated datasets and real applications. The results indicate that the proposed DTSC algorithm effectively detects time series clusters with arbitrary shapes and similar attributes and densities while considering noises.

Cite

CITATION STYLE

APA

Wang, X., Liu, Y., Chen, Y., & Liu, Y. (2016). An Adaptive Density-Based Time Series Clustering Algorithm: A Case Study on Rainfall Patterns. ISPRS International Journal of Geo-Information, 5(11). https://doi.org/10.3390/ijgi5110205

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