As an important part of urban big data, traffic flow data play a critical role in traffic management and emergency response. Traffic flow data contain multi-mode characteristics, which need to be deeply mined. To make full use of multi-mode characteristics, we use a 3-order tensor to represent the traffic flow data, considering “temporal-spatial-periodic” characteristics. To recover the missing data of traffic flow, we propose the Missing Data Completion Algorithm Based on Residual Value Tensor Decomposition (MDCA-RVTD), which combines linear regression, univariate spline, and CP decomposition. Then, we predict the future traffic flow data by using the proposed Traffic Flow Prediction Algorithm Based on Data Completion Strategy (TFPA-DCS). The experimental results show that recovering the missing data is helpful in improving the prediction accuracy. Additionally, the prediction accuracy of the proposed Algorithm is better than gray model and traditional tensor CP decomposition method.
Accurate time-series forecasting plays a vital role in sensor-driven applications such as energy monitoring, traffic flow prediction, and environmental sensing. While most existing approaches focus on extracting local patterns from historical observations, they often overlook the global temporal information embedded in timestamps. However, this information represents a valuable yet underutilized aspect of sensor-based data that can significantly enhance forecasting performance. In this paper, we propose a novel timestamp-guided knowledge distillation framework (TKDF), which integrates both historical and timestamp information through mutual learning between heterogeneous prediction branches to improve forecasting robustness. The framework comprises two complementary branches: a Backbone Model that captures local dependencies from historical sequences, and a Timestamp Mapper that learns global temporal patterns encoded in timestamp features. To enhance information transfer and reduce representational redundancy, a self-distillation mechanism is introduced within the Timestamp Mapper. Extensive experiments on multiple real-world sensor datasets—covering electricity consumption, traffic flow, and meteorological measurements—demonstrate that the TKDF consistently improves the performance of mainstream forecasting models.
Software defect prediction datasets often suffer from issues such as class imbalance, noise, and class overlap, making it difficult for classifiers to identify instances of defects. In response, researchers have proposed various techniques to mitigate the impact of these issues on classifier performance. Oversampling is a widely used method to address class imbalance. However, in addition to inherent noise and class overlap in the datasets themselves, oversampling methods can introduce new noise and class overlap while addressing class imbalance. To tackle these challenges, we propose a software defect prediction method called AS-KDENN, which simultaneously improves the effects of class imbalance, noise, and class overlap on classification models. AS-KDENN first performs oversampling using the Adaptive Synthetic Sampling Method (ADASYN), followed by our proposed KDENN method to address noise and class overlap. Unlike traditional methods, KDENN takes into account both the distance and local density information of overlapping samples, allowing for a more reasonable elimination of noise and instances of overlapping. To demonstrate the effectiveness of the AS-KDENN method, we conducted extensive experiments on 19 publicly available software defect prediction datasets. Compared to four commonly used oversampling techniques that also address class overlap or noise, the AS-KDENN method effectively alleviates issues of class imbalance, noise, and class overlap, subsequently improving the performance of the classifier models.
The prediction of Remaining Useful Life (RUL) constitutes a vital aspect of Prognostics and Health Management (PHM), providing capabilities for the assessment of mechanical component health status and prediction of failure instances. Recent studies on feature extraction, time-series modeling, and multi-task learning have shown remarkable advancements. However, most deep learning (DL) techniques predominantly focus on unimodal data or static feature extraction techniques, resulting in a lack of RUL prediction methods that can effectively capture the individual differences among heterogeneous sensors and failure modes under complex operational conditions. To overcome these limitations, an adaptive RUL prediction framework named ADAPT-RULNet is proposed for mechanical components, integrating the feature extraction capabilities of attention-enhanced deep learning (DL) and the decision-making abilities of deep reinforcement learning (DRL) to achieve end-to-end optimization from raw data to accurate RUL prediction. Initially, Functional Alignment Resampling (FAR) is employed to generate high-quality functional signals; then, attention-enhanced Dynamic Time Warping (DTW) is leveraged to obtain individual degradation stages. Subsequently, an attention-enhanced of hybrid multi-scale RUL prediction network is constructed to extract both local and global features from multi-format data. Furthermore, the network achieves optimal feature representation by adaptively fusing multi-source features through Bayesian methods. Finally, we innovatively introduce a Deep Deterministic Policy Gradient (DDPG) strategy from DRL to adaptively optimize key parameters in the construction of individual degradation stages and achieve a global balance between model complexity and prediction accuracy. The proposed model was evaluated on aircraft engines and railway freight car wheels. The results indicate that it achieves a lower average Root Mean Square Error (RMSE) and higher accuracy in comparison with current approaches. Moreover, the method shows strong potential for improving prediction accuracy and robustness in varied industrial applications.
With the continuous improvement in the efficiency of the heavy-haul railway freight transportation, the pressure on on-site maintenance is increasing. In-depth research on fault characteristics carries significant importance for fault scientific judgment and fault prevention. This study proposes an efficient association rule mining (ARM) algorithm, HM-RDHP, for analyzing fault data from heavy-haul railway freight trains. The algorithm introduces distributed parallel computing technology, integrating the MapReduce framework and HBase on the Hadoop platform to process large volumes of complex fault data efficiently. Experimental results show that the HM-RDHP algorithm can efficiently uncover hidden patterns and associations within the fault data of heavy-haul railway freight trains. The mined association rules provide a valuable reference model to aid in predictive maintenance and fault prevention strategies for freight train maintenance departments.
With the increasing demand for heavy-haul railway freight, both the number and volume of heavy-haul freight cars continue to grow. As the core system of railway freight transportation, the reliable operation of the brake system is fundamental to ensuring train safety. The freight car braking system fault diagnosis model, which relies on historical data while failing to account for changes in braking curves when locomotives are coupled with different vehicles, is the main reason why early failures of the braking system are not diagnosed. Consequently, real-time monitoring of the freight car braking system and early fault diagnosis have emerged as a pivotal technical challenge that necessitates resolution within the framework of the railway freight maintenance reform. This paper proposes a novel hybrid-driven prediction method that effectively combines Convolutional Neural Networks, Adaptive Radial Basis Function Neural Networks, and Extreme Learning Machines (CARE). To achieve comprehensive fault feature extraction, based on CNN of the image data classification, the K-means clustering algorithm is introduced to adaptively initialize the radial basis centers of the RBF and recalculate the radial basis radii. Moreover, to improve the real-time performance and accuracy of fault diagnosis, the network layers are expanded, and the ELM algorithm is employed to construct an optimization strategy for high-dimensional data processing in the network layers. The experimental results demonstrate that when considering the coupling of different vehicles in the railway freight car, the proposed CARE model exhibits faster convergence speed and significantly improves the effectiveness and real-time performance of fault diagnosis in the railway freight car braking system.