hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.17559/TV-20190103125702

Hierarchical Clustering of Time Series Based on Linear Information Granules

Hailan Chen   ORCID icon orcid.org/0000-0002-4275-4471 ; Donlinks School of Economics and Management, University of Science and Technology Beijing, No. 30 Xueyuan Road, Haidian District, Beijing, China
Xuedong Gao ; Donlinks School of Economics and Management, University of Science and Technology Beijing, No. 30 Xueyuan Road, Haidian District, Beijing, China
Yifan Guo ; School of Management, China University of Mining and Technology, Ding No. 11 Xueyuan Road, Haidian District, Beijing, China

Puni tekst: engleski, pdf (1 MB) str. 478-485 preuzimanja: 371* citiraj
APA 6th Edition
Chen, H., Gao, X. i Guo, Y. (2019). Hierarchical Clustering of Time Series Based on Linear Information Granules. Tehnički vjesnik, 26 (2), 478-485. https://doi.org/10.17559/TV-20190103125702
MLA 8th Edition
Chen, Hailan, et al. "Hierarchical Clustering of Time Series Based on Linear Information Granules." Tehnički vjesnik, vol. 26, br. 2, 2019, str. 478-485. https://doi.org/10.17559/TV-20190103125702. Citirano 15.05.2021.
Chicago 17th Edition
Chen, Hailan, Xuedong Gao i Yifan Guo. "Hierarchical Clustering of Time Series Based on Linear Information Granules." Tehnički vjesnik 26, br. 2 (2019): 478-485. https://doi.org/10.17559/TV-20190103125702
Harvard
Chen, H., Gao, X., i Guo, Y. (2019). 'Hierarchical Clustering of Time Series Based on Linear Information Granules', Tehnički vjesnik, 26(2), str. 478-485. https://doi.org/10.17559/TV-20190103125702
Vancouver
Chen H, Gao X, Guo Y. Hierarchical Clustering of Time Series Based on Linear Information Granules. Tehnički vjesnik [Internet]. 2019 [pristupljeno 15.05.2021.];26(2):478-485. https://doi.org/10.17559/TV-20190103125702
IEEE
H. Chen, X. Gao i Y. Guo, "Hierarchical Clustering of Time Series Based on Linear Information Granules", Tehnički vjesnik, vol.26, br. 2, str. 478-485, 2019. [Online]. https://doi.org/10.17559/TV-20190103125702

Sažetak
Time series clustering is one of the main tasks in time series data mining. In this paper, a new time series clustering algorithm is proposed based on linear information granules. First, we improve the identification method of fluctuation points using threshold set, which represents the main trend information of the original time series. Then using fluctuation points as segmented nodes, we segment the original time series into several information granules, and linear function is used to represent the information granules. With information granulation, a granular time series consisting of several linear information granules replaces the original time series. In order to cluster time series, we then propose a linear information granules based segmented matching distance measurement (LIG_SMD) to calculate the distance between every two granular time series. In addition, hierarchical clustering method is applied based on the new distance (LIG_SMD_HC) to get clustering results. Finally, some public and real datasets about time series are experimented to examine the effectiveness of the proposed algorithm. Specifically, Euclidean distance based hierarchical clustering (ED_HC) and Dynamic Time Warping distance based hierarchical clustering (DTW_HC) are used as the compared algorithms. Our results show that LIG_SMD_HC is better than ED_HC and DTW_HC in terms of F-Measure and Accuracy.

Ključne riječi
distance measurement; hierarchical clustering; information granules; time series

Hrčak ID: 219540

URI
https://hrcak.srce.hr/219540

Posjeta: 603 *