Improving Anomaly Detection in Industrial Time Series: The Role of Segmentation and Heterogeneous Ensemble

• URL: http://arxiv.org/abs/2510.09079v1
• Date: Fri, 10 Oct 2025 07:24:47 GMT
• Title: Improving Anomaly Detection in Industrial Time Series: The Role of Segmentation and Heterogeneous Ensemble
• Authors: Emilio Mastriani, Alessandro Costa, Federico Incardona, Kevin Munari, Sebastiano Spinello,
• Abstract summary: We show how the integration of segmentation techniques, combined with a heterogeneous ensemble, can enhance anomaly detection in an industrial production context.<n>We improve the AUC-ROC metric from 0.8599 (achieved with a PCA and LSTM ensemble) to 0.9760 (achieved with Random Forest and XGBoost)<n>In our future work, we intend to assess the benefit of introducing weighted features derived from the study of change points, combined with segmentation and the use of heterogeneous ensembles, to further optimize model performance in early anomaly detection.
• Score: 36.94429692322632
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Concerning machine learning, segmentation models can identify state changes within time series, facilitating the detection of transitions between normal and anomalous conditions. Specific techniques such as Change Point Detection (CPD), particularly algorithms like ChangeFinder, have been successfully applied to segment time series and improve anomaly detection by reducing temporal uncertainty, especially in multivariate environments. In this work, we explored how the integration of segmentation techniques, combined with a heterogeneous ensemble, can enhance anomaly detection in an industrial production context. The results show that applying segmentation as a pre-processing step before selecting heterogeneous ensemble algorithms provided a significant advantage in our case study, improving the AUC-ROC metric from 0.8599 (achieved with a PCA and LSTM ensemble) to 0.9760 (achieved with Random Forest and XGBoost). This improvement is imputable to the ability of segmentation to reduce temporal ambiguity and facilitate the learning process of supervised algorithms. In our future work, we intend to assess the benefit of introducing weighted features derived from the study of change points, combined with segmentation and the use of heterogeneous ensembles, to further optimize model performance in early anomaly detection.

Related papers

• Segmentation over Complexity: Evaluating Ensemble and Hybrid Approaches for Anomaly Detection in Industrial Time Series [36.94429692322632]
  We evaluate the impact of change point-derived statistical features, clustering-based substructure representations, and hybrid learning strategies on detection performance.<n>The ensemble achieved an AUC-ROC of 0.976, F1-score of 0.41, and 100% early detection within the defined time window.
  arXiv  Detail & Related papers  (2025-10-30T05:39:44Z)
• Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes [7.266872790554742]
  Multiple change point (MCP) detection in non-stationary time series is challenging due to the variety of underlying patterns.<n>We propose a novel algorithm that integrates Active Learning (AL) with Deep Gaussian Processes (DGPs) for robust MCP detection.
  arXiv  Detail & Related papers  (2025-05-26T18:46:59Z)
• Decomposed Global Optimization for Robust Point Matching with Low-Dimensional Branching [41.05165517541873]
  We introduce a novel global optimization method for align partially overlapping point sets.<n>Our method exhibits superior robustness to non-rigid deformations, positional noise and outliers.<n> Experiments on 2D and 3D synthetic and real-world data demonstrate that our method, compared to state-of-the-art approaches, exhibits superior robustness to outliers.
  arXiv  Detail & Related papers  (2024-05-14T13:28:57Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• Detection of Anomalies in Multivariate Time Series Using Ensemble Techniques [3.2422067155309806]
  We propose an ensemble technique that combines multiple base models toward the final decision. A semi-supervised approach using a Logistic Regressor to combine the base models' outputs is also proposed. The performance improvement in terms of anomaly detection accuracy reaches 2% for the unsupervised and at least 10% for the semi-supervised models.
  arXiv  Detail & Related papers  (2023-08-06T17:51:22Z)
• Learning to Bound Counterfactual Inference in Structural Causal Models from Observational and Randomised Data [64.96984404868411]
  We derive a likelihood characterisation for the overall data that leads us to extend a previous EM-based algorithm. The new algorithm learns to approximate the (unidentifiability) region of model parameters from such mixed data sources. It delivers interval approximations to counterfactual results, which collapse to points in the identifiable case.
  arXiv  Detail & Related papers  (2022-12-06T12:42:11Z)
• Compound Batch Normalization for Long-tailed Image Classification [77.42829178064807]
  We propose a compound batch normalization method based on a Gaussian mixture. It can model the feature space more comprehensively and reduce the dominance of head classes. The proposed method outperforms existing methods on long-tailed image classification.
  arXiv  Detail & Related papers  (2022-12-02T07:31:39Z)
• Revisiting Consistency Regularization for Semi-Supervised Learning [80.28461584135967]
  We propose an improved consistency regularization framework by a simple yet effective technique, FeatDistLoss. Experimental results show that our model defines a new state of the art for various datasets and settings.
  arXiv  Detail & Related papers  (2021-12-10T20:46:13Z)
• Variational methods for contracting projected entangled-pair states [0.0]
  In this paper, we identify a subclass of PEPS for which we can reformulate the contraction as a variational problem that is algorithm independent. We use this variational feature to assess and compare the accuracy of CTMRG and VUMPS contractions. We devise a new variational contraction scheme, which we can extend to compute general N-point correlation functions.
  arXiv  Detail & Related papers  (2021-10-25T08:31:10Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• Differentially Private ADMM for Convex Distributed Learning: Improved Accuracy via Multi-Step Approximation [10.742065340992525]
  Alternating Direction Method of Multipliers (ADMM) is a popular computation for distributed learning. When the training data is sensitive, the exchanged iterates will cause serious privacy concern. We propose a new differentially private distributed ADMM with improved accuracy for a wide range of convex learning problems.
  arXiv  Detail & Related papers  (2020-05-16T07:17:31Z)
• CRATOS: Cognition of Reliable Algorithm for Time-series Optimal Solution [12.906367105870341]
  CRATOS is a self-adapt algorithms that extract features from time series, and then cluster series with similar features into one group. Our methods can significantly reduce the cost of development and maintenance of anomaly detection. The accuracy of the anomaly detection algorithms in this paper is 85.1%.
  arXiv  Detail & Related papers  (2020-03-03T09:49:30Z)
• Optimization of Graph Total Variation via Active-Set-based Combinatorial Reconditioning [48.42916680063503]
  We propose a novel adaptive preconditioning strategy for proximal algorithms on this problem class. We show that nested-forest decomposition of the inactive edges yields a guaranteed local linear convergence rate. Our results suggest that local convergence analysis can serve as a guideline for selecting variable metrics in proximal algorithms.
  arXiv  Detail & Related papers  (2020-02-27T16:33:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.