paper-with-me

홈 › Papers

Evaluating Simplification Algorithms for Interpretability of Time Series Classification

2025-05-13 · Felix Marti-Perez, Brigt Håvardstun, Cèsar Ferri, Carlos Monserrat, Jan Arne Telle

In this work, we introduce metrics to evaluate the use of simplified time series in the context of interpretability of a TSC - a Time Series Classifier. Such simplifications are important because time series data, in contrast to text and image data, are not intuitively understandable to humans. These metrics are related to the complexity of the simplifications - how many segments they contain - and to their loyalty - how likely they are to maintain the classification of the original time series. We employ these metrics to evaluate four distinct simplification algorithms, across several TSC algorithms and across datasets of varying characteristics, from seasonal or stationary to short or long. Our findings suggest that using simplifications for interpretability of TSC is much better than using the original time series, particularly when the time series are seasonal, non-stationary and/or with low entropy.

📄 PDF Abstract BibTeX arXiv:2505.08846

Code (0)

등록된 구현이 없습니다.

Tasks

Time SeriesTime Series Classification

Similar Papers 제목 키워드 기반

TSInterpret: A unified framework for time series interpretability

2022-08-10 · Jacqueline Höllig, Cedric Kulbach, Steffen Thoma

With the increasing application of deep learning algorithms to time series classification, especially in high-stake scenarios, the relevance of interpreting those algorithms becomes key. Although research in time series …

Interpretable Machine LearningTime SeriesTime Series AnalysisTime Series Classification

Semantic Structural Evaluation for Text Simplification

2018-10-11 · NAACL 2018 6 · Elior Sulem, Omri Abend, Ari Rappoport

Current measures for evaluating text simplification systems focus on evaluating lexical text aspects, neglecting its structural aspects. In this paper we propose the first measure to address structural aspects of text si…

Semantic ParsingSentenceText Simplificationvalid

Improvement in Variational Quantum Algorithms by Measurement Simplification

2023-12-11 · Jaehoon Hahm, Hayeon Kim, Young June Park

Variational Quantum Algorithms (VQAs) are expected to be promising algorithms with quantum advantages that can be run at quantum computers in the close future. In this work, we review simple rules in basic quantum circui…

Quantum Machine Learning

Interpretable Time Series Classification using All-Subsequence Learning and Symbolic Representations in Time and Frequency Domains

2018-08-12 · Thach Le Nguyen, Severin Gsponer, Iulia Ilie, Georgiana Ifrim

The time series classification literature has expanded rapidly over the last decade, with many new classification approaches published each year. The research focus has mostly been on improving the accuracy and efficienc…

AllClassificationfeature selectionGeneral Classification+3

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

2025-02-18 · Paul Boniol, Donato Tiano, Angela Bonifati, Themis Palpanas

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 ce…

ClusteringGraph EmbeddingTime SeriesTime Series Clustering