Persistence-Based Discretization for Learning Discrete Event Systems from Time Series

by   Lénaïg Cornanguer, et al.

To get a good understanding of a dynamical system, it is convenient to have an interpretable and versatile model of it. Timed discrete event systems are a kind of model that respond to these requirements. However, such models can be inferred from timestamped event sequences but not directly from numerical data. To solve this problem, a discretization step must be done to identify events or symbols in the time series. Persist is a discretization method that intends to create persisting symbols by using a score called persistence score. This allows to mitigate the risk of undesirable symbol changes that would lead to a too complex model. After the study of the persistence score, we point out that it tends to favor excessive cases making it miss interesting persisting symbols. To correct this behavior, we replace the metric used in the persistence score, the Kullback-Leibler divergence, with the Wasserstein distance. Experiments show that the improved persistence score enhances Persist's ability to capture the information of the original time series and that it makes it better suited for discrete event systems learning.


page 1

page 2

page 3

page 4


Using Zigzag Persistent Homology to Detect Hopf Bifurcations in Dynamical Systems

Bifurcations in dynamical systems characterize qualitative changes in th...

Dimension Reduction of Two-Dimensional Persistence via Distance Deformations

This article grew out of the application part of my Master's thesis at t...

Importance attribution in neural networks by means of persistence landscapes of time series

We propose and implement a method to analyze time series with a neural n...

Persistent Homology of Complex Networks for Dynamic State Detection

In this paper we develop a novel Topological Data Analysis (TDA) approac...

Temporal Network Analysis Using Zigzag Persistence

This work presents a framework for studying temporal networks using zigz...

Extremal Event Graphs: A (Stable) Tool for Analyzing Noisy Time Series Data

Local maxima and minima, or extremal events, in experimental time series...

Simultaneously Updating All Persistence Values in Reinforcement Learning

In reinforcement learning, the performance of learning agents is highly ...

Please sign up or login with your details

Forgot password? Click here to reset