Evidence map›Paper›PMID 42048398›Full record

ArticlePloS one2026

Traffic flow prediction via dynamic hypergraph learning.

SiWei Wei, Yang Yang, ChunZhi Wang

Abstract read
In one paragraph

Article in PloS one, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

SiWei WeiSchool of Computer Science and Artificial Intelligence, Wuhan University of Technology, Wuhan, China.
Yang YangSchool of Computer Science, Hubei University of Technology, Wuhan, China.
ChunZhi WangSchool of Computer Science, Hubei University of Technology, Wuhan, China.ORCID https://orcid.org/0000-0002-6742-3644

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In the field of intelligent transportation systems, efficiently and accurately predicting traffic flow and its evolution trends has become an important and urgent research task. Graph neural networks have been widely used in traffic flow prediction problems, but many methods ignore the high-order relationship of patterns between traffic flow and traffic nodes. To address the above issues, we propose a Transformer-based Hypergraph Convolutional Network (TSHGCN) for traffic flow prediction. Firstly, we adopt a hypergraph structure to more effectively capture the high-order nonlinear spatial correlations between traffic nodes. Then, an improved Transformer network is proposed, which accurately captured the global temporal features among various traffic nodes by combining the time distillation mechanism and the self-attention network. In addition, we integrate the above spatiotemporal modeling through efficient channel attention mechanism and multi-scale temporal information fusion mechanism, accurately extracting spatiotemporal features and achieving the final refined representation of traffic flow. Experiments on the California datasets (PeMSD4 and PeMSD8) with 5 independent random seed runs and strict statistical tests show that the TSHGCN model achieves the best performance on core metrics (MAE, RMSE, MAPE) under a unified experimental setting, and the performance improvement over state-of-the-art baselines is statistically significant.

Indexed as

TransportationAlgorithmsGraph Neural NetworksHumansPrediction Algorithms

Identifiers

PMID42048398
PMCPMC13124063

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.