Next Article in Journal
Uncertainty-Based Map Matching: The Space-Time Prism and k-Shortest Path Algorithm
Previous Article in Journal
Radio Astronomy Demonstrator: Assessment of the Appropriate Sites through a GIS Open Source Application
Article Menu
Issue 11 (November) cover image

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2016, 5(11), 205; doi:10.3390/ijgi5110205

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

1
School of Resource and Environment Science, Wuhan University, 129 Luoyu Road, Wuhan 430079, China
2
Key Laboratory of Geographic Information System, Ministry of Education, Wuhan University, 129 Luoyu Road, Wuhan 430079, China
3
Collaborative Innovation Center of Geospatial Information Technology, Wuhan University, 129 Luoyu Road, Wuhan 430079, China
*
Author to whom correspondence should be addressed.
Academic Editor: Wolfgang Kainz
Received: 22 August 2016 / Revised: 25 October 2016 / Accepted: 4 November 2016 / Published: 10 November 2016
View Full-Text   |   Download PDF [10792 KB, uploaded 22 November 2016]   |  

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. View Full-Text
Keywords: time series clustering; adaptive; density-based clustering; Delaunay triangulation; spatial data mining time series clustering; adaptive; density-based clustering; Delaunay triangulation; spatial data mining
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Wang, X.; Liu, Y.; Chen, Y.; Liu, Y. An Adaptive Density-Based Time Series Clustering Algorithm: A Case Study on Rainfall Patterns. ISPRS Int. J. Geo-Inf. 2016, 5, 205.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top