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

Abstract
Objective: This study investigates the applicability of systematic methods in the identification and evaluation of studies on sustainable urban mobility, providing subsidies to guide managers and policymakers in the development of efficient and environmentally responsible public policies.   Method: The methodology adopted for this research comprises a Systematic Literature Review (SLR) associated with the Fuzzy-TOPSIS method, a multi-criteria model capable of evaluating and prioritizing studies considering the imprecision inherent in decision-making processes. The PICO technique was used to define the analysis criteria, and the PRISMA protocol ensured the transparency and replicability of the results. Six criteria were established in the qualitative analyses for treatment in the Fuzzy-TOPSIS method.   Results and Discussion: The proposed approach proved effective in selecting the most relevant studies. The discussion points to the need to integrate Fuzzy-TOPSIS with complementary methods, such as DEMATEL and Social Network Analysis (SNA), in order to improve the modeling of causal relationships and strengthen the reliability of prioritization.   Research Implications: The results offer important insights for urban planning and the formulation of public policies, contributing to energy efficiency, reducing GHG emissions and improving the quality of public transport.   Originality/Value: The innovation of this study lies in the combination of quantitative and qualitative approaches to the analysis of sustainable mobility, providing a robust benchmark that can positively influence practices and strategies in urban management.

Abstract
The learning from continuous data streams is a relevant area within machine learning, focusing on the creation and updating of predictive models in real time as new data becomes available for training and prediction. Among the most widely used methods for this type of task, Hoeffding Trees are highly valued for their simplicity and robustness across a variety of applications and are considered the primary choice for generating decision trees in data stream contexts. However, Hoeffding Trees tend to continuously expand as new data is incorporated, resulting in increased processing time and memory consumption, often without providing significant gains in accuracy. In this study, we propose an instance selection scheme that combines different strategies to regularize Hoeffding Trees and their variants, mitigating excessive growth without compromising model accuracy. The method selects misclassified instances and a fraction of correctly classified instances during the training phase. After extensive experimental evaluation, the instance selection scheme demonstrates superior predictive performance compared to the original models (without selection), for both real and synthetic datasets for data streams, using a reduced subset of examples. Additionally, the method achieves relevant improvements in processing time, model complexity, and memory consumption, highlighting the effectiveness of the proposed instance selection scheme.

Abstract
Nearest neighbor search (NNS) is one of the main concerns in data stream applications since similarity queries can be used in multiple scenarios. Online NNS is usually performed on a sliding window by lazily scanning every element currently stored in the window. This paper proposes Sliding Window-based Incremental Nearest Neighbors (SWINN), a graph-based online search index algorithm for speeding up NNS in potentially never-ending and dynamic data stream tasks. Our proposal broadens the application of online NNS-based solutions, as even moderately large data buffers become impractical to handle when a naive NNS strategy is selected. SWINN enables efficient handling of large data buffers by using an incremental strategy to build and update a search graph supporting any distance metric. Vertices can be added and removed from the search graph. To keep the graph reliable for search queries, lightweight graph maintenance routines are run. According to experimental results, SWINN is significantly faster than performing a naive complete scan of the data buffer while keeping competitive search recall values. We also apply SWINN to online classification and regression tasks and show that our proposal is effective against popular online machine learning algorithms.