YWYang Wang

Yang Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yang Wang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Reinforcement Learning-Based Collaborative Framework for Data Imputation and Fault Diagnosis with Online Segment Missing Data

    by Zhaojing Wang, Tianwei Xu, Bowen Song, Yang Wang, Li Li

    In Industrial Internet of Things environments, issues such as sensor failures often lead to missing data. Compared with random missing, segment missing causes severe temporal discontinuity and loss of critical features. However, most existing methods are designed for random missing patterns and cannot effectively handle such scenarios, resulting in significant decline in fault diagnosis performance.To address this issue, this paper proposes a reinforcement learning-based collaborative framework for data imputation and fault diagnosis to improve diagnostic reliability with segment missing data. First, based on generative adversarial imputation network, a dimension-wise random masking matrix is designed for segment missing, a hint mechanism is introduced to strengthen the discriminator’s constraint on missingness, and a joint loss function that balances observed-data preservation and missing-data reconstruction accuracy is constructed to enhance imputation quality. Second, a strategy based on deep deterministic policy gradient is introduced, in which fault diagnosis performance is used as the reward signal and dimension contribution scores are calculated to guide data imputation, enabling the model to preferentially recover feature dimensions that are more critical for diagnosis. In addition, a progressive two-stage training strategy, consisting of step-by-step pretraining and feedback-driven closed-loop optimization, is designed to reduce training difficulty and improve convergence stability. Finally, experiments conducted on the Huazhong University of Science and Technology bearing dataset and the Southeast University gearbox dataset demonstrate that, under segment missing conditions, the proposed method significantly outperforms existing methods in fault diagnosis accuracy and robustness, and that all proposed modules contribute positively to overall performance.

  • Toward Interpretable Imputation: Through Discovering Spatiotemporal Patterns of Urban Metro Flow Data

    by Yang Wang, Chen Yin, Yining Dong

    The rapid growth of the Internet of Things (IoT) has enabled the development of intelligent transportation systems (ITS). However, missing data remains a common issue that hinders the effectiveness of ITS. Although many imputation methods have been proposed to handle missing values, they generally aim to improve the accuracy of final imputation results and often neglect the interpretability of the imputation process. This may cause limited trustworthiness and practical applicability in real-world metro management, where understanding the underlying metro data patterns is essential. To address this gap, this article conducts an in-depth analysis and mining of the unique spatiotemporal structures inherent in metro flow data, aiming at both accurate and interpretable imputation. Specifically, an orthogonal-autoregression matrix factorization (OAMF) algorithm is proposed to discover two low-dimensional, complete spatial and temporal patterns from high-dimensional, incomplete data. By minimizing reconstruction error associated with these two patterns, OAMF ensures the accuracy of final imputation results. Furthermore, through simultaneous distinctive spatial representation modeling and predictive temporal modeling, OAMF encourages the two patterns with clear physical meaning that capture orthogonal spatial distributions and evolving metro flow trends over time, enabling the interpretability of the imputation process. Additionally, the above explicit temporal modeling further extends OAMF’s ability to predict futures. The proposed OAMF is validated using two real-world datasets. Experimental results demonstrate that OAMF not only extracts interpretable spatiotemporal patterns but also achieves superior accuracy in both imputation and prediction across various missing rates compared to existing methods.

  • Predictable Latent Features Learning for High-Dimensional Seasonal Time Series Analysis and Forecasting

    by Yang Wang, Bingyuan Li, Yining Dong

    Analysis and prediction of high-dimensional time series are prevalent in numerous real-world scenarios, such as urban traffic. Traditional methods often struggle with the redundancy and cross-correlation inherent in such data, leading to computational inefficiencies and reduced accuracy. Additionally, the failure to account for seasonal characteristics further hampers their ability to capture essential temporal dependencies, thereby diminishing predictive accuracy. In this paper, we introduce a novel reduced-dimensional seasonal autoregressive modeling algorithm with a canonical correlation analysis objective (RDSAR-CCA) to simultaneously extract predictable latent features (PLFs) and forecast the future values of high-dimensional time series with seasonality. This algorithm first maps the original, high-dimensional time series into a latent, reduced-dimensional subspace, which simplifies the complex data into more easily analyzed and visualized forms. For each latent feature, an explicit seasonal autoregressive model is constructed to capture complex temporal dependencies. Further, a canonical correlation analysis-based objective is proposed to extract these PLFs one after another, with a descending order of predictability. The established explicit latent seasonal autoregressive models facilitate the prediction of PLFs and, consequently, enable the accurate prediction of the original data via inverse mapping. The effectiveness and superiority of the proposed algorithm are evaluated on a simulation example and the passenger flow data collected from 166 stations of the Shenzhen metro.


  • Fine-Grained Monitoring With Orthogonal Projection to Dynamic Latent Structure Model for Closed-Loop Industrial IoT

    by Yang Wang, Yining Dong

    In closed-loop Industrial Internet of Things (IIoT), not all deviations lead to the process out of control due to the compensation of controllers. Normal operating condition changes, dynamic anomalies with unchanged operating conditions, and complete loss of control can be finely distinguished by monitoring static or dynamic components of the process. However, the existing methods often suffer from overlapping decomposition of dynamic and static components with limited interpretability, which causes information leak and reduces monitoring performance. To address these issues, this article presents an orthogonal projection to dynamic latent structure (OP-DLS) method, enabling fine-grained process monitoring that distinguishes different types of deviations. Specifically, by jointly minimizing the dynamic unpredictable variance and the static reconstruction error, OP-DLS maps process data onto nonoverlapped dynamic and static subspaces through an orthogonal projection to prevent information leak. In addition, the temporal dependence and representative properties of dynamic components are explicitly modeled for better generalization and interpretability. Building upon this, targeted monitoring indices are designed to monitor the dynamic, static, and global aspects of the process for fine-grained distinction of different types of deviations. Compared with the existing methods, the superiority of our proposed method is validated through a numerical example, a wastewater treatment process, and an industrial-scale three-phase flow facility process.


  • A Projective Weighted DTW-Based Monitoring Approach for Multi-Stage Processes With Unequal Durations

    by Ying Zheng, Peiming Wang, Yang Wang, David Shan-Hill Wong

    Multi-stage processes, such as batch and transition processes, often have unequal operation duration due to differing conditions, posing significant challenges to process monitoring. Although dynamic time warping (DTW) has been applied for offline synchronization, it cannot adequately align an evolving, incomplete online batch with completed historical batches due to inherent inconsistencies in their progression. Moreover, traditional methods generally overlook time-scale faults in the operational progress of the process, which undermines overall monitoring performance. To address these issues, a novel projective weighted DTW (PwDTW)-based method is proposed to monitor multi-stage processes with unequal durations. First, the asymmetric weighted DTW is adopted to offline align the original training dataset with different lengths, incorporating the Itakura parallelogram constraint to restrict the region of the warping path. Then, the PwDTW with an open-ended strategy is proposed to handle the online asynchronization problem by assessing the progress and similarity of the ongoing trajectory against each training trajectory. Further, the k-nearest neighbor (KNN) is used to identify the most similar subsequences of the training dataset with the online trajectory. Leveraging these subsequences, two monitoring indices are designed to monitor the process in not only amplitude scale but also time scale. The two indices reflect both the strength and speed of the process. Finally, a benchmark Tennessee Eastman process and a practical semiconductor manufacturing case are introduced to prove the effectiveness of the proposed method.