Hidden degenerations in industrial time series often precede observable failures, they remain undetected by standard monitoring systems until anomalies become apparent. This gap between microscopic degradation and macroscopic observation renders conventional predictors inherently reactive, as they rely on correlations in sensor data rather than uncovering the underlying, physics‑consistent degradation states. Crucially, the microscopic mechanisms governing system evolution depend on macroscopic state variables—whose measurements are expectations over microscopic probability distributions—so purely data‑driven “top‑down” or purely physics‑guided “bottom‑up” approaches cannot forecast degeneration‑entangled industrial faults. To address these challenges, we propose a Physics-Guided Bidirectional Inference Framework that represents hidden microscopic states from macroscopic measurements. Our approach uniquely combines: (1) bottom-up physics-based simulation using Continuum Damage Mechanics to model micro-scale damage evolution under environmental stressors, and (2) top-down probabilistic inference via maximum entropy formalism to estimate latent microstate distributions from sparse sensor data. This bidirectional mechanism enables early failure prediction by bridging observable measurements with unobservable degeneration. Validation on real-world railway infrastruc datasets demonstrates significant improvements in early fault prediction compared to state-of-the-art baselines. Our method establishes a new paradigm for safety-critical industrial applications requiring reliable prediction of hidden degeneration processes.

Time series forecasting has become a critical task in data engineering, with the volume of time series data projected to reach 180 ZB by 2025. While traditional forecasting models are typically constrained to single domains, missing opportunities for transferring temporal patterns across different domains. Through analysis, we observe that time series from different domains, despite their distinct statistical characteristics, can be fundamentally understood through temporal dependency patterns, which manifest as either long-term dependencies ( like trends and cycles) or short-term dependencies ( like fluctuations and abrupt changes). This observation motivates us to rethink cross-domain modeling from the dependency preferences perspective. We propose LSTPO, a novel framework that captures cross-domain commonalities through temporal dependency preferences and leverages a meta-learning-based approach to prevent cross-domain training forgetting. LSTPO dynamically models changes in preference over time and swiftly adapts to preference variations across different domains, enabling robust cross-domain forecasting. Through extensive experimental evaluations, we have shown that LSTPO substantially outperforms state-of-the-art forecasting methods while enhancing model transferability under few-shot learning conditions. The source code will be made publicly available upon acceptance.

Text-Attributed Heterogeneous Graphs (TAHGs) integrate topological relationships with rich textual node attributes, offering expressive representations for complex multi-faceted data. While recent methods jointly leverage textual and structural information, they still face two critical limitations: (i) existing approaches are constrained to neighborhood modeling, failing to capture semantic dependencies in higher-order topologies; (ii) current techniques exhibit inadequate unified alignment strategies, limiting dynamic interaction between cross modalities. To address these challenges, we propose SATH, a self-supervised information aggregation model for TAHGs, designed to effectively leverage textual and structural information within TAHGs. SATH aggregates higher-order neighbor textual attributes through comparative learning, and dynamically aligns these attributes to higher-order topologies through a unified strategy. This approach integrates both types of information effectively, enhancing the expressiveness and discriminative capability of the learned node representations in downstream tasks. Extensive experiments on real-world datasets demonstrate that SATH significantly outperforms baseline models while eliminating the need for manual meta-path design or text feature concatenation. It also improves efficiency and scalability on large-scale TAHGs, achieving superior representation quality in TAHG-based tasks.

Medicine recommendation assists physicians in automatically providing medicine combinations, which is critical in health care. Existing efforts focus on making medicine recommendations based on the patient’s electronic health record(EHR). However, they ignore external medicine knowledge and are vulnerable to the missing EHR. In this paper, a knowledge-enhanced dual graph neural network (KDGN) is proposed to recommend medicine sets. KDGN combines diagnosis-level and procedure-level attention mechanisms to encode multiple types of medical codes. In order to mine medicine from medical knowledge, KDGN further designs a dual-graph neural network, which constructs a medicine co-occurrence graph and molecular connection graph, and retrieves potential therapeutic drugs. Furthermore, during the training phase, we introduce the automatic correction loss based on maximum likelihood estimation to mitigate the impact of missing EHR and enhance the robustness of KDGN. We evaluate the proposed model on the public MIMIC-III dataset, and experimental results show that KDGN outperforms the state-of-the-art model in 4 out of 5 evaluation metrics. Our dataset and code are available at: https://github.com/Benjamin-cell/KDGN.

BACKGROUND: Clinical notes are documents that contain detailed information about the health status of patients. Medical codes generally accompany them. However, the manual diagnosis is costly and error-prone. Moreover, large datasets in clinical diagnosis are susceptible to noise labels because of erroneous manual annotation. Therefore, machine learning has been utilized to perform automatic diagnoses. Previous state-of-the-art (SOTA) models used convolutional neural networks to build document representations for predicting medical codes. However, the clinical notes are usually long-tailed. Moreover, most models fail to deal with the noise during code allocation. Therefore, denoising mechanism and long-tailed classification are the keys to automated coding at scale. RESULTS: In this paper, a new joint learning model is proposed to extend our attention model for predicting medical codes from clinical notes. On the MIMIC-III-50 dataset, our model outperforms all the baselines and SOTA models in all quantitative metrics. On the MIMIC-III-full dataset, our model outperforms in the macro-F1, micro-F1, macro-AUC, and precision at eight compared to the most advanced models. In addition, after introducing the denoising mechanism, the convergence speed of the model becomes faster, and the loss of the model is reduced overall. CONCLUSIONS: The innovations of our model are threefold: firstly, the code-specific representation can be identified by adopted the self-attention mechanism and the label attention mechanism. Secondly, the performance of the long-tailed distributions can be boosted by introducing the joint learning mechanism. Thirdly, the denoising mechanism is suitable for reducing the noise effects in medical code prediction. Finally, we evaluate the effectiveness of our model on the widely-used MIMIC-III datasets and achieve new SOTA results.