In this work, a new approach to cluster large sets of time series is presented. The proposed methodology takes into account the dependency among the time series to obtain a fuzzy partition of the set of observations. A two-step procedure to accomplish this is presented. First, the cophenetic distances, based on a time series linear cross-dependency measure, are obtained. Second, these distances are used as an input of a non-Euclidean fuzzy relational clustering algorithm. As a result, we obtain a robust fuzzy procedure capable of detecting groups of time series with different types of cross-dependency. We illustrate the usefulness of the stated methodology through some Monte Carlo experiments and a real data example. Our results show that the methodology proposed in this work substantially improves the hard partitioning clustering alternative. (C) 2021 The Authors. Published by Elsevier Inc.
Cophenetic-based fuzzy clustering of time series by linear dependency / Alonso, Andrés M.; D'Urso, Pierpaolo; Gamboa, Carolina; Guerrero, Vanesa. - In: INTERNATIONAL JOURNAL OF APPROXIMATE REASONING. - ISSN 0888-613X. - 137:(2021), pp. 114-136. [10.1016/j.ijar.2021.07.006]
Cophenetic-based fuzzy clustering of time series by linear dependency
Pierpaolo D'Urso;
2021
Abstract
In this work, a new approach to cluster large sets of time series is presented. The proposed methodology takes into account the dependency among the time series to obtain a fuzzy partition of the set of observations. A two-step procedure to accomplish this is presented. First, the cophenetic distances, based on a time series linear cross-dependency measure, are obtained. Second, these distances are used as an input of a non-Euclidean fuzzy relational clustering algorithm. As a result, we obtain a robust fuzzy procedure capable of detecting groups of time series with different types of cross-dependency. We illustrate the usefulness of the stated methodology through some Monte Carlo experiments and a real data example. Our results show that the methodology proposed in this work substantially improves the hard partitioning clustering alternative. (C) 2021 The Authors. Published by Elsevier Inc.File | Dimensione | Formato | |
---|---|---|---|
1-s2.0-S0888613X21001055-main (1).pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
2.56 MB
Formato
Adobe PDF
|
2.56 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.