2016
DOI: 10.3390/ijgi5110205
|View full text |Cite
|
Sign up to set email alerts
|

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

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 limitati… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…Cluster analysis maximizes the similarity of objects in a single class and minimizes the similarity of objects between different classes. In traffic data mining, commonly used clustering algorithms include partition-based k-means algorithm [10,11], hierarchical clustering algorithm [12], density-based spatial clustering of applications with noise algorithm [13,14], and FCM clustering algorithm [15][16][17].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Cluster analysis maximizes the similarity of objects in a single class and minimizes the similarity of objects between different classes. In traffic data mining, commonly used clustering algorithms include partition-based k-means algorithm [10,11], hierarchical clustering algorithm [12], density-based spatial clustering of applications with noise algorithm [13,14], and FCM clustering algorithm [15][16][17].…”
Section: Literature Reviewmentioning
confidence: 99%
“…e density-based spatial clustering of applications with noise algorithm also has a fast clustering speed. is algorithm can effectively process noisy data to find spatial clusters of arbitrary shapes and does not require entering the number of clusters during the clustering process [13]. However, when the density of spatial clustering is not uniform and the cluster spacing is large, the clustering results obtained by the density-based spatial clustering of applications with noise algorithm are poor.…”
Section: Literature Reviewmentioning
confidence: 99%