FeatTS: Feature-based Time Series Clustering

33Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Clustering time series is a recurrent problem in real-life applications involving data science and data analytics pipelines. Existing time series clustering algorithms are ineffective for feature-rich real-world time series since they only compare the time series based on raw data or use a fixed set of features for determining the similarity. In this paper, we showcase FeatTS, a feature-based semi-supervised clustering framework addressing the above issues for variable-length and heterogeneous time series. Specifically, FeatTS leverages a graph encoding of the time series that is obtained by considering a high number of significant extracted features. It then employs community detection and builds upon a Co-Occurrence matrix in order to unify all the best clustering results. We let the user explore the various steps of FeatTS by visualizing the initial data, its graph encoding and its division into communities along with the obtained clusters. We show how the user can interact with the process for the choice of the features and for varying the percentage of input labels and the various parameters. In view of its characteristics, FeatTS outperforms the state of the art clustering methods and is the first to be able to digest domain-specific time series such as healthcare time series, while still being robust and scalable.

Cite

CITATION STYLE

APA

Tiano, D., Bonifati, A., & Ng, R. (2021). FeatTS: Feature-based Time Series Clustering. In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 2784–2788). Association for Computing Machinery. https://doi.org/10.1145/3448016.3452757

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free