Abstract
This study introduces a method to assess the quality of Explainable Artificial Intelligence (XAI) algorithms in dynamic data streams, concentrating on the fidelity and stability of feature-importance and rule-based explanations. We employ XAI metrics, such as fidelity and Lipschitz Stability, to compare explainers between each other and introduce the Comparative Expert Stability Index (CESI) for benchmarking explainers against domain knowledge. We adopted the aforementioned metrics to the streaming data scenario and tested them in an unsupervised classification scenario with simulated distribution shifts as different classes. The necessity for adaptable explainers in complex scenarios, like failure detection is underscored, stressing the importance of continued research into versatile explanation techniques to enhance XAI system robustness and interpretability.

Abstract

Abstract
Deep neural networks (DNN) are used to analyze images, videos, signals and texts require a lot of memory and intensive computing power. For example, the very successful GPT4 model contains more than a few trillion parameters. Although such models are of great impact, but they have been used very little in real-world applications, including industrial Internet of Things, self-driving cars, algorithmic health monitoring for use in limited mobile or edge devices. The requirement to run large models on resource-constrained peripherals has led to significant research interest in compressing DNN models. Signal processing researchers have traditionally advocated data (image/video/audio) compression, and by the way, many of these techniques are used for DNN compression. For example, source coding is a basic technique that has been widely used to compress various DNN models. In this paper, we present our views on the use of signal processing methods for DNN model compression.

Abstract
Early identification of failures is a critical task in predictive maintenance, preventing potential problems before they manifest and resulting in substantial time and cost savings for industries. We propose an approach that predicts failures in the near future. First, a deep learning model combining long short-term memory and convolutional neural network architectures predicts signals for a future time horizon using real-time data. In the second step, an autoencoder based on convolutional neural networks detects anomalies in these predicted signals. Finally, a verification step ensures that a fault is considered reliable only if it is corroborated by anomalies in multiple signals simultaneously. We validate our approach using publicly available Air Production Unit (APU) data from Porto metro trains. Two significant conclusions emerge from our study. Firstly, experimental results confirm the effectiveness of our approach, demonstrating a high fault detection rate and a reduced number of false positives. Secondly, the adaptability of this proposal allows for the customization of configuration of different time horizons and relationship between the signals to meet specific detection requirements.

Abstract
Image segmentation for detecting illegal landfill waste in aerial images is essential for environmental crime monitoring. Despite advancements in segmentation models, the primary challenge in this domain is the lack of annotated data due to the unknown locations of illegal waste disposals. This work mainly focuses on evaluating segmentation models for identifying individual illegal landfill waste segments using limited annotations. This research seeks to lay the groundwork for a comprehensive model evaluation to contribute to environmental crime monitoring and sustainability efforts by proposing to harness the combination of agnostic segmentation and supervised classification approaches. We mainly explore different metrics and combinations to better understand how to measure the quality of this applied segmentation problem. © 2024 The Authors.

Abstract
Effective anomaly detection in telecommunication networks is essential for securing digital transactions and supporting the sustainability of our global information ecosystem. However, the volume of data in such high-speed distributed environments imposes strict latency and scalability requirements on anomaly detection systems. This study focuses on distributed heavy hitter detection in telephone networks - a critical component of network traffic analysis and fraud detection. We propose a federated version of the Lossy Counting algorithm and compare it to its centralized version. Our experimental results reveal that the federated approach can detect considerably more unique heavy hitters than the centralized method while enhancing privacy. Furthermore, Federated Lossy Counting does not need a large amount of centralized processing power since it can leverage the networked infrastructure with minimal impact on bandwidth and computing power. © 2024 The Authors.