Lars Henning’s research while affiliated with Vrana GmbH (Germany) and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (2)


FIGURE 2. Lorenz-attractor dataset. Computed with ˙ X = s(Y − X ); ˙ Y = rX −Y − XZ ; ˙ Z = XY −bZ and parameters used s = 10, r = 28 and b = 2.667. Color and marker size indicate amount of curvature on a logarithmic scale for better visibility.
FIGURE 3. Qualitative visualization of the (a) curvature κ, (b) torsion τ , (c) speed v and (d) acceleration a computed on part of the thomas-attractor dataset. Color and marker size indicate amount of curve parameter on a logarithmic scale for better visibility (dark and thin means low value, bright and thick means high value). Axis labels and colorbar labels are along the lines of Figure 2.
Autoencoder-Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm
  • Article
  • Full-text available

January 2023

·

95 Reads

·

3 Citations

IEEE Access

·

Lars Henning

·

Clemens Guhmann

This paper introduces an algorithm for the detection of change-points and the identification of the corresponding subsequences in transient multivariate time-series data (MTSD). The analysis of such data has become increasingly important due to growing availability in many industrial fields. Labeling, sorting or filtering highly transient measurement data for training Condition-based Maintenance (CbM) models is cumbersome and error-prone. For some applications it can be sufficient to filter measurements by simple thresholds or finding change-points based on changes in mean value and variation. But a robust diagnosis of a component within a component group for example, which has a complex non-linear correlation between multiple sensor values, a simple approach would not be feasible. No meaningful and coherent measurement data, which could be used for training a CbM model, would emerge. Therefore, we introduce an algorithm that uses a recurrent neural network (RNN) based Autoencoder (AE) which is iteratively trained on incoming data. The scoring function uses the reconstruction error and latent space information. A model of the identified subsequence is saved and used for recognition of repeating subsequences as well as fast offline clustering. For evaluation, we propose a new similarity measure based on the curvature for a more intuitive time-series subsequence clustering metric. A comparison with seven other state-of-the-art algorithms and eight datasets shows the capability and the increased performance of our algorithm to cluster MTSD online and offline in conjunction with mechatronic systems.

Download

Autoencoder Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm

September 2022

·

94 Reads

This paper introduces an algorithm for the detection of change-points and the identification of the corresponding subsequences in transient multivariate time-series data (MTSD). The analysis of such data has become more and more important due to the increase of availability in many industrial fields. Labeling, sorting or filtering highly transient measurement data for training condition based maintenance (CbM) models is cumbersome and error-prone. For some applications it can be sufficient to filter measurements by simple thresholds or finding change-points based on changes in mean value and variation. But a robust diagnosis of a component within a component group for example, which has a complex non-linear correlation between multiple sensor values, a simple approach would not be feasible. No meaningful and coherent measurement data which could be used for training a CbM model would emerge. Therefore, we introduce an algorithm which uses a recurrent neural network (RNN) based Autoencoder (AE) which is iteratively trained on incoming data. The scoring function uses the reconstruction error and latent space information. A model of the identified subsequence is saved and used for recognition of repeating subsequences as well as fast offline clustering. For evaluation, we propose a new similarity measure based on the curvature for a more intuitive time-series subsequence clustering metric. A comparison with seven other state-of-the-art algorithms and eight datasets shows the capability and the increased performance of our algorithm to cluster MTSD online and offline in conjunction with mechatronic systems.

Citations (1)


... The strategy involves utilizing the distance function (such as Euclidean distance for univariate data) to calculate the error value of each sliding window, and identifying abnormal windows based on a provided threshold. However, determining an appropriate value for the number of clusters k is challenging [71] [72]. Clustering algorithms like Kmeans and hierarchical clustering often yield ineffective results for time series data, causing unresolved issues. ...

Reference:

Deep Learning for Anomaly Detection in Time-Series Data: An Analysis of Techniques, Review of Applications, and Guidelines for Future Research
Autoencoder-Based Iterative Modeling and Multivariate Time-Series Subsequence Clustering Algorithm

IEEE Access