Abstract
AbstractTime series data, spanning applications ranging from climatology to finance to healthcare, presents significant challenges in data mining due to its size and complexity. One open issue lies in time series clustering, which is crucial for processing large volumes of unlabeled time series data and unlocking valuable insights. Traditional and modern analysis methods, however, often struggle with these complexities. To address these limitations, we introduce R-Clustering, a novel method that utilizes convolutional architectures with randomly selected parameters. Through extensive evaluations, R-Clustering demonstrates superior performance over existing methods in terms of clustering accuracy, computational efficiency and scalability. Empirical results obtained using the UCR archive demonstrate the effectiveness of our approach across diverse time series datasets. The findings highlight the significance of R-Clustering in various domains and applications, contributing to the advancement of time series data mining.
Funder
Ministerio de Asuntos Econ-os y Transformaci-igital, Gobierno de Espa
Universidad Carlos III
Publisher
Springer Science and Business Media LLC
Reference60 articles.
1. Aggarwal CC, Hinneburg A, Keim DA (2001) On the surprising behavior of distance metrics in high dimensional space. In: Database theory-ICDT 2001: 8th international conference London, UK, January 4–6, 2001 Proceedings 8, Springer, pp 420–434
2. Aghabozorgi S, Shirkhorshidi AS, Wah TY (2015) Time-series clustering-a decade review. Inform Syst 53:16–38
3. Benavoli A, Corani G, Mangili F (2016) Should we really use post-hoc tests based on mean-ranks? The J Mach Learn Res 17(1):152–161
4. Bengio Y, Courville A, Vincent P (2013) Representation learning: A review and new perspectives. IEEE Trans Pattern Anal Mach Int 35(8):1798–1828
5. Berndt DJ, Clifford J (1994) Using dynamic time warping to find patterns in time series. KDD workshop. Seattle, WA, USA, pp 359–370