k-Graph: A Graph Embedding for Interpretable Time Series Clustering

2025/02/18 by Boniol, Paul, Tiano, Donato, Bonifati, Angela +1
#FOS: Computer and information sciences #Machine Learning (cs.LG)

paper · doi:10.48550/arxiv.2502.13049

Abstract

Time series clustering poses a significant challenge with diverse applications across domains. A prominent drawback of existing solutions lies in their limited interpretability, often confined to presenting users with centroids. In addressing this gap, our work presents k-Graph, an unsupervised method explicitly crafted to augment interpretability in time series clustering. Leveraging a graph representation of time series subsequences, k-Graph constructs multiple graph representations based on different subsequence lengths. This feature accommodates variable-length time series without requiring users to predetermine subsequence lengths. Our experimental results reveal that k-Graph outperforms current state-of-the-art time series clustering algorithms in accuracy, while providing users with meaningful explanations and interpretations of the clustering outcomes.

Related

• Graphint: Graph-based Time Series Clustering Visualisation Tool
• k-Shape
• Towards Explainable Deep Clustering for Time Series Data
• Bridging the Gap: A Decade Review of Time-Series Clustering Methods
• Interpretable Time Series Clustering Using Local Explanations