Hang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hang Chen has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Chuanbin Zhang
School of Computer Science and Software, Zhaoqing University, Zhaoqing 526061, China
2 shared publications - Jiaxian Zhu
School of Computer Science and Software, Zhaoqing University, Zhaoqing 526061, China
2 shared publications - Teng Zhou
Hainan University
2 shared publications - Weihua Bai
School of Computer Science and Software, Zhaoqing University, Zhaoqing 526061, China
2 shared publications - Huibing Zhang
Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin 541004, China
1 shared publication - Wenwei Cai
School of Computer Science and Software, Zhaoqing University, Zhaoqing 526061, China
1 shared publication
Latest Publications
- Open Access
- 21 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4336
CausalSTKT: Disentangled Spatiotemporal Heterogeneous Graph Learning for Robust Knowledge Tracing Under Distribution Shifts
Knowledge tracing supports adaptive intelligent tutoring systems by estimating learners’ evolving knowledge states from sequential interactions. However, existing models often rely on dataset-specific correlations and may suffer substantial performance degradation under distribution shifts. This paper proposes CausalSTKT, an SCM-guided knowledge tracing framework that integrates spatiotemporal modeling over a global item–knowledge-component bipartite graph with disentangled representation learning. A relation-aware graph encoder captures high-order dependencies among items and knowledge components, while a temporal transition module models the evolution of learner states. To reduce sensitivity to environmental variation, the learned representation is decomposed into a mastery component and an environment component using a directional decorrelation penalty. An environment-resampling mechanism, which recombines the mastery component of one learner–step pair with the environment component of an unrelated pair drawn at random within the mini-batch, is further introduced to encourage predictions that are stable across environments. We also derive an out-of-distribution risk bound showing that a smaller representation-entanglement residual leads to a tighter generalization bound under the stated assumptions. Experiments on five real-world educational datasets demonstrate that CausalSTKT achieves a mean AUC of 0.8371 and a mean accuracy of 0.8136, exceeding the strongest baseline on each metric by 3.42 and 3.61 percentage points, respectively. In the evaluated zero-shot cross-dataset transfer settings, its average AUC drop is 9.1%, compared with 20.0% and 21.1% for the two baselines evaluated under the same protocol. These results indicate that CausalSTKT provides a robust computational approach to knowledge tracing in intelligent learning systems affected by distribution shifts.
- 21 September 2026
- Published by MDPI AG in Electronics
- Vol. 15 (18) , 4336
Open AccessCausalSTKT: Disentangled Spatiotemporal Heterogeneous Graph Learning for Robust Knowledge Tracing Under Distribution Shifts
Knowledge tracing supports adaptive intelligent tutoring systems by estimating learners’ evolving knowledge states from sequential interactions. However, existing models often rely on dataset-specific correlations and may suffer substantial performance degradation under distribution shifts. This paper proposes CausalSTKT, an SCM-guided knowledge tracing framework that integrates spatiotemporal modeling over a global item–knowledge-component bipartite graph with disentangled representation learning. A relation-aware graph encoder captures high-order dependencies among items and knowledge components, while a temporal transition module models the evolution of learner states. To reduce sensitivity to environmental variation, the learned representation is decomposed into a mastery component and an environment component using a directional decorrelation penalty. An environment-resampling mechanism, which recombines the mastery component of one learner–step pair with the environment component of an unrelated pair drawn at random within the mini-batch, is further introduced to encourage predictions that are stable across environments. We also derive an out-of-distribution risk bound showing that a smaller representation-entanglement residual leads to a tighter generalization bound under the stated assumptions. Experiments on five real-world educational datasets demonstrate that CausalSTKT achieves a mean AUC of 0.8371 and a mean accuracy of 0.8136, exceeding the strongest baseline on each metric by 3.42 and 3.61 percentage points, respectively. In the evaluated zero-shot cross-dataset transfer settings, its average AUC drop is 9.1%, compared with 20.0% and 21.1% for the two baselines evaluated under the same protocol. These results indicate that CausalSTKT provides a robust computational approach to knowledge tracing in intelligent learning systems affected by distribution shifts.
- Open Access
- 26 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1457
Mathematical Modeling of Learnable Discrete Wavelet Transform for Adaptive Feature Extraction in Noisy Non-Stationary Signals
The mathematical characterization of non-stationary signals remains a significant challenge, particularly when impulsive components are obscured by high-dimensional noise and structural coupling. This paper proposes an application-driven mathematical methodology for a learnable discrete wavelet transform (LDWT) that combines classical multi-resolution analysis with task-optimized data-driven adaptivity. Rather than introducing entirely new foundational theory, our approach strategically relaxes constraints from orthogonal wavelet theory within the non-perfect reconstruction filter bank framework, enabling controlled spectral decomposition optimized for supervised fault diagnosis. We introduce a specialized regularization term based on the half-band property to ensure spectral complementarity and minimize cross-band correlation, while a Jacobian-based stabilization approach is formulated to ensure the convergence of filter coefficients during optimization. The proposed algorithmic architecture, LDBRFnet, features a dual-branch encoder system designed to capture the mathematical synergy between sub-band-level global statistics and time-domain local morphology. This dual-view representation effectively mitigates feature leakage and overconfidence in classification. Theoretical analysis and numerical experiments demonstrate that the learned filters satisfy the frequency-shift property and maintain robust spectral partitioning even under low signal-to-noise ratios. Validation on complex vibration datasets confirms that the framework achieves superior diagnostic accuracy (over 95.5%) and computational efficiency, reducing model parameters by 96.7% compared to state-of-the-art baselines. This work provides a generalizable mathematical approach for adaptive signal decomposition and robust pattern recognition in interdisciplinary applications.
- 26 April 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (9) , 1457
Open AccessMathematical Modeling of Learnable Discrete Wavelet Transform for Adaptive Feature Extraction in Noisy Non-Stationary Signals
The mathematical characterization of non-stationary signals remains a significant challenge, particularly when impulsive components are obscured by high-dimensional noise and structural coupling. This paper proposes an application-driven mathematical methodology for a learnable discrete wavelet transform (LDWT) that combines classical multi-resolution analysis with task-optimized data-driven adaptivity. Rather than introducing entirely new foundational theory, our approach strategically relaxes constraints from orthogonal wavelet theory within the non-perfect reconstruction filter bank framework, enabling controlled spectral decomposition optimized for supervised fault diagnosis. We introduce a specialized regularization term based on the half-band property to ensure spectral complementarity and minimize cross-band correlation, while a Jacobian-based stabilization approach is formulated to ensure the convergence of filter coefficients during optimization. The proposed algorithmic architecture, LDBRFnet, features a dual-branch encoder system designed to capture the mathematical synergy between sub-band-level global statistics and time-domain local morphology. This dual-view representation effectively mitigates feature leakage and overconfidence in classification. Theoretical analysis and numerical experiments demonstrate that the learned filters satisfy the frequency-shift property and maintain robust spectral partitioning even under low signal-to-noise ratios. Validation on complex vibration datasets confirms that the framework achieves superior diagnostic accuracy (over 95.5%) and computational efficiency, reducing model parameters by 96.7% compared to state-of-the-art baselines. This work provides a generalizable mathematical approach for adaptive signal decomposition and robust pattern recognition in interdisciplinary applications.