Mengmeng chang

Dr. Mengmeng chang


Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
7 February 2024 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
MCMengmeng chang
Mengmeng chang
ZDZhiming ding
Zhiming ding
ZZZilin Zhao
Zilin Zhao
Zhi CaiZhi Cai
Zhi Cai
Traffic patterns in the spatiotemporal network are affected by temporal dynamics and spatial correlations. The network flows have different strengths interacting at various implicit layers, and this dynamic process needs to be further explored. Predicting future traffic based on historical data from transportation IoT has been well studied, however, most of the works focus on traffic dynamics in the homogeneous spatial or temporal structure. When the spatiotemporal graph structure turns complex, it becomes a challenge to capture the deep traffic patterns on it. In this paper, a heterogeneous modular flows graph is constructed to characterize the implied spatiotemporal correlations within the traffic data. Then, we proposed a Multilayer Graph Skip Temporal Convolution Network (MGSTCN) which extracts skip aggregated representations of node status to the modular flows graph. And an extended random walk on diverse modular graphs is used to learn the spatial dependencies. The experiments based on real traffic networks confirmed that the MGSTCN has a better performance compared to the spatiotemporal homogeneous methods.

11 August 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
MCMengmeng chang
Mengmeng chang
ZDZhiming ding
Zhiming ding
Zhi CaiZhi Cai
Zhi Cai
ZZZilin Zhao
Zilin Zhao
LYLei Yuan
Lei Yuan
With the deterioration of the transportation ecosystem and traffic congestion, traffic graph representations become more complex and lack intelligibility. The deep learning method provides a new way for traffic prediction by mining the spatiotemporal relations of historical states in traffic network. Recurrent neural networks based on gate control can avoid the gradient vanishing and graph convolutional networks provide theoretical support for spatial feature extraction of traffic graph. However, in the prediction of traffic evolution behaviors, the statuses of units and groups distributed in the traffic network have strong and continuous spatiotemporal correlations. Modeling only based on the temporal or spatial perspective usually lacks comprehensiveness and semantic relevance which results in poor prediction performance. In this paper, we propose a spatiotemporal hierarchical propagation graph convolutional network(SHPGCN) to get the whole spatiotemporal evolution features of traffic graph, which can be used to predict the propagation effects and state changes of traffic flow. Considered the inadequacy of graph convolution in the learning of hierarchical features, we construct a low-dimensional propagation graph representation that projects complex node relationships into first-order neighborhoods to capture dynamic changes at different spatial and temporal scales. The SHPGCN uses graph convolution to encode the traffic propagation features and embeds them into a bidirectional recurrent sequence for traffic prediction. The experiment results show that SHPGCN can provide good prediction accuracy and robustness for the traffic evolution behaviors.


31 October 2025 in Results in Engineering
Verified
Journal Article
Open access
LHLiqin Han
Liqin Han
XLXiang Li
Xiang Li
MCMengmeng chang
Mengmeng chang
YLYayan Lu
Yayan Lu

2 February 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
ZZZilin Zhao
Zilin Zhao
Zhi CaiZhi Cai
Zhi Cai
MCMengmeng chang
Mengmeng chang
ZDZhiming ding
Zhiming ding
Unconventional events exacerbate the imbalance between regional transportation demand and limited road network resources. Scientific and efficient path planning serves as the foundation for rapidly restoring equilibrium to the road network. In real large-scale road networks, especially during emergencies, it is usually difficult to obtain or predict accurate dynamic traffic network flows in real-time, which is used to support equilibrium path planning. Moreover, the traditional iterative methods cannot meet the real-time demand of emergency equilibrium path planning decision generation. To solve the above problems, this paper proposes a hybrid control architecture for path planning based on equilibrium traffic assignment theory. The architecture introduces the travelers’ real-time travel data and constructs a spatio-temporal neural network, which captures the evolution of traffic network loads. Adaptive multi-graph fusion technology is used to mix the background traffic flow data and the traveler’s real-time Origin–Destination (OD) data, to mine the dynamic correlation between the traffic state and the travelers’ travel. Based on the real-time prediction of dynamic network states, equilibrium mapping learning is carried out to pre-allocate potential travel demands and construct equilibrium traffic graphs based on system optimization traffic assignment. Finally, individual evacuation path strategies are generated online in a data-driven manner in real time to achieve improved resilience in the transportation system.

21 April 2026 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
CLChaodie Liu
Chaodie Liu
FNFeiping Nie
Feiping Nie
MCMengmeng chang
Mengmeng chang
RWRong Wang
Rong Wang
XLXuelong Li
Xuelong Li
Graph-based multi-view clustering has become a powerful tool for multi-view data analysis by jointly capturing structural relationships across heterogeneous views. Despite significant advances in this field, several limitations persist. Most graph-based multi-view algorithms employ a relaxation-and-discretization two-stage paradigm to obtain clustering assignments, which may significantly undermine information preservation and clustering performance. Moreover, these methods often suffer from quadratic or even cubic time complexity, rendering them impractical for large-scale applications. Additionally, existing graph-based multi-view models struggle to adequately capture the inherent uncertainty characterized by ambiguous or overlapping clustering boundaries. To address these challenges, this paper proposes a multi-view fuzzy clustering method with anchor graph. Specifically, the proposed method learns a symmetric and doubly stochastic consensus similarity graph from multiple views and performs clustering directly on the learned consensus graph, thereby directly outputting clustering results. By imposing nonnegativity and row normalization constraints on the cluster indicator matrix, the proposed method can further reveal the underlying uncertain clustering structure. Furthermore, an iterative optimization algorithm with linear complexity is developed to solve the proposed model. Extensive experiments conducted on both synthetic and real-world benchmark datasets illustrate the effectiveness and efficiency of the proposed method against state-of-the-art models.