Abstract
Time series forecasting is pivotal across industries, as it fosters data-driven decision-making, increasing the chances of successful outcomes. Yet, certain instances that feature adverse characteristics, may lead models to manifest stress through decreases in performance (e.g., large errors). Hence, the ability to preemptively identify such cases, while establishing their root causes, would be advantageous to elevate the understanding of forecasting processes, informing users about the trustworthiness of predictions. Hence, we propose MASTFM, a method based on meta-learning that leverages statistical characteristics of input time series, and estimations of forecasting performance from model outputs, to build a metamodel that learns conditions for stress. Given that such occurrences are naturally rare, data augmentation is employed to ensure balance during training. Moreover, SHapley Additive exPlanations (SHAP) are used to explain how features impact forecasting behaviour.

Abstract
Early fault detection remains a critical challenge in predictive maintenance (PdM), particularly within critical infrastructure, where undetected failures or delayed interventions can compromise safety and disrupt operations. Traditional anomaly detection methods are typically reactive, relying on real-time sensor data to identify deviations as they occur. This reactive nature often provides insufficient lead time for effective maintenance planning. To address this limitation, we propose a novel two-stage early detection framework that integrates time series forecasting with anomaly detection to anticipate equipment failures several hours in advance. In the first stage, future sensor signal values are predicted using forecasting models; in the second, conventional anomaly detection algorithms are applied directly to the forecasted data. By shifting from real-time to anticipatory detection, the framework aims to deliver actionable early warnings, enabling timely and preventive maintenance. We validate this approach through a case study focused on metro train systems, an environment where early fault detection is crucial for minimizing service disruptions, optimizing maintenance schedules, and ensuring passenger safety. The framework is evaluated across three forecast horizons (1, 3, and 6 hours ahead) using twelve state-of-the-art anomaly detection algorithms from diverse methodological families. Detection performance is assessed using five performance metrics. Results show that anomaly detection remains highly effective at short to medium horizons, with performance at 1-hour and 3-hour forecasts comparable to that of real-time data. Ensemble and deep learning models exhibit strong robustness to forecast uncertainty, maintaining consistent results with real-time data even at 6-hour forecasts. In contrast, distance- and density-based models suffer substantial degradation at longer horizons (6-hours), reflecting their sensitivity to distributional shifts in predicted signals. Overall, the proposed framework offers a practical and extensible solution for enhancing traditional PdM systems with proactive capabilities. By enabling early anomaly detection on forecasted data, it supports improved decision-making, operational resilience, and maintenance planning in industrial environments.

Abstract
One of the key aspects of Industry 4.0 is using intelligent systems to optimize manufacturing processes by improving productivity and reducing costs. These systems have greatly impacted in different areas, such as demand prediction and quality assessment. However, the prognostics and health management of industrial equipment is one of the areas with greater potential. This paper presents a comparative analysis of deep learning architectures applied to the prediction of the remaining useful life (RUL) on public real industrial datasets. The analysis includes some of the most commonly employed recurrent neural network variations and a novel approach based on a hybrid architecture using transformers. Moreover, we apply explainability techniques to provide comprehensive insights into the model's decision-making process. The contributions of the work are: (1) a novel transformer-based architecture for RUL prediction that outperforms traditional recurrent neural networks; (2) a detailed description of the design strategies used to construct the models on two under-explored datasets; (3) the use of explainability techniques to understand the feature importance and to explain the model's prediction and (4) making models built for reproducibility available to other researchers.

Abstract
Predictive maintenance applications have increasingly been approached with deep learning techniques in recent years due to their high predictive performance. However, as in other real-world application scenarios, the need for explainability is often stated but not sufficiently addressed, which can limit adoption in practice. In this study, we will focus on predicting failures of trains operating in Porto, Portugal. While recent works have found high-performing deep neural network architectures that feature a parallel explainability pipeline, we find that the generated explanations can be hard to comprehend in practice due to their low support over the failure range. In this work, we propose a novel online rule-learning approach that is able to generate simple rules that cover the entirety of the detected failures. We evaluate our method against AMRules, a state-of-the-art online rule-learning approach, on two datasets gathered from trains operated by Metro do Porto. Our experiments show that our approach consistently generates rules with very high support that are simultaneously short and interpretable.

Abstract
In the evolving field of machine learning, ensuring group fairness has become a critical concern, prompting the development of algorithms designed to mitigate bias in decision-making processes. Group fairness refers to the principle that a model's decisions should be equitable across different groups defined by sensitive attributes such as gender or race, ensuring that individuals from privileged groups and unprivileged groups are treated fairly and receive similar outcomes. However, achieving fairness in the presence of group-specific concept drift remains an unexplored frontier, and our research represents pioneering efforts in this regard. Group-specific concept drift refers to situations where one group experiences concept drift over time, while another does not, leading to a decrease in fairness even if accuracy (ACC) remains fairly stable. Within the framework of federated learning (FL), where clients collaboratively train models, its distributed nature further amplifies these challenges since each client can experience group-specific concept drift independently while still sharing the same underlying concept, creating a complex and dynamic environment for maintaining fairness. The most significant contribution of our research is the formalization and introduction of the problem of group-specific concept drift and its distributed counterpart, shedding light on its critical importance in the field of fairness. In addition, leveraging insights from prior research, we adapt an existing distributed concept drift adaptation algorithm to tackle group-specific distributed concept drift, which uses a multimodel approach, a local group-specific drift detection mechanism, and continuous clustering of models over time. The findings from our experiments highlight the importance of addressing group-specific concept drift and its distributed counterpart to advance fairness in machine learning.

Abstract