Mengyun Xu

Dr. Mengyun Xu

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 May 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XWXuesong Wu
Xuesong Wu
MXMengyun Xu
Mengyun Xu
JFJie FANG
Jie FANG
XWXiongwei Wu
Xiongwei Wu
The widespread deployment of road sensors in the Internet of Things (IoT) allows for fine-grained data integration, which is a fundamental demand for data-driven applications. Sensing data with inevitable missing and substantial anomalies are unavoidable, due to unstable network communication, faulty sensors, etc. Recent tensor completion studies have demonstrated the superiority of deep learning in imputation tasks by precisely capturing the intricate spatiotemporal dependencies/correlations. However, ignoring the significance of initial interpolation in these methods results in unstable performance, especially for complicated missing scenarios across large-scale data. Additionally, the existing interpolation methods utilize recursive signal propagation along spatiotemporal dimensions, which produce noise accumulation where the dependencies are uncorrelated. In this study, we design a multiattention tensor completion network (MATCN) for modeling multidimensional representation in the presence of missing entries. MATCN sparsely sampled historical fragments and utilized a gated diffusion convolution layer to generate the initial schemes, which mitigate the exposure bias existing in previous traffic imputation models. In addition, we develop a spatial signal propagation module and a temporal self-attention module as the basic stack block of deep networks, which executes representation aggregation and dynamic dependencies extraction at the spatiotemporal level. This architecture empowers MATCN with progressive completion capacities for complex data missing scenarios. Numerical experiments on four real-world traffic data sets with various missing scenarios demonstrate the superiority of MATCN over multiple state-of-the-art imputation baselines.

27 May 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
JFJie FANG
Jie FANG
YYYa You
Ya You
MXMengyun Xu
Mengyun Xu
JWJuanmeizi Wang
Juanmeizi Wang
SCSibin Cai
Sibin Cai

16 February 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
SCSibin Cai
Sibin Cai
JFJie FANG
Jie FANG
MXMengyun Xu
Mengyun Xu

25 June 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
JFJie FANG
Jie FANG
HHHangyu He
Hangyu He
MXMengyun Xu
Mengyun Xu
HCHongting Chen
Hongting Chen

28 March 2025 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SCSibin Cai
Sibin Cai
JFJie FANG
Jie FANG
MXMengyun Xu
Mengyun Xu
Currently, congestion has become a common urban disease. Recently, traffic control methods leveraging reinforcement learning (RL) have gained significant attention due to their capability to effectively utilize real-time traffic data. However, existing RL-based methods for multi-intersection traffic signal control (TSC) solely focus on enhancing network-level performance, which can potentially exacerbate traffic conditions at specific intersections, making it unreasonable. This balance of network-level and local intersection traffic conditions is referred to as the fairness issue in TSC. To address the aforementioned fairness issue and further alleviate congestion, a multi-agent reinforcement learning (MARL) algorithm, COunterfactual Multi-Agent policy gradients (COMA), which, compared to Multi-agent Advantage Actor-Critic (MA2C), is characterized by its use of counterfactual advantage estimation to effectively resolve the credit assignment problem, was employed in multi-intersection TSC domain. However, as an on-policy algorithm, COMA encounters limitations in training sample utilization, specifically in terms of inefficient sample usage and temporal correlation among samples. To enhance the efficiency of sample usage and to mitigate the temporal correlation among training samples, thereby improving overall training efficiency, we introduced (a) importance sampling and (b) distributed computing. COMA, when incorporating importance sampling and distributed computing, evolved into our method, Advanced-COMA, which demonstrated effectiveness in the experiments. Additionally, a fairness-aware reward function was designed to better address fairness considerations. Finally, extensive experiments were conducted on both synthetic and real-world traffic networks, including grid and arterial scenarios. The results confirmed the superiority of our methods in enhancing traffic conditions and fairness. Some details can be found on https://github.com/caisibin/FS.

21 October 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
JFJie Fang
Jie Fang
YSYuqing Shi
Yuqing Shi
MXMengyun Xu
Mengyun Xu