Evidence map›Paper›PMID 40410234›Full record

ArticleScientific reports2025

Combined CNN-BiLSTM-Att tourism flow prediction based on VMD-MWPE decomposition reconstruction.

Maomao Luo, Danhong Chen, Xinxing Hou, Kang Luo, Tao Wang

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing 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

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
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

5 authors.

Maomao LuoGongQing Institute of Science and Technology, Jiujiang, 332020, Jiangxi, China. jzmm1991@outlook.com.
Danhong ChenShenyang Aerospace University, Shenyang, 110136, Liaoning, China.
Xinxing HouEast China Jiaotong University, Nanchang, 330013, Jiangxi, China.
Kang LuoGongQing Institute of Science and Technology, Jiujiang, 332020, Jiangxi, China.
Tao WangShenyang Aerospace University, Shenyang, 110136, Liaoning, China.

Funding

Jiujiang Natural Science Foundation S2024KXJJ0001Science and Technology Programme of the Jiangxi Provincial Department of Education GJJ2409107
6 · The paper itself

Abstract

Predicting tourist flow is crucial for making effective management decisions at scenic spots. To further improve the accuracy of scenic passenger flow prediction, the current study proposed a data preprocessing approach that combines variational modal decomposition (VMD) with multiscale weighted permutation entropy (MWPE). Additionally, a tourist flow prediction method was introduced, utilizing a combination of bi-layer convolution, bidirectional long short-term memory, and an attention mechanism (CNN-BiLSTM-Att). First, the historical passenger flow data was decomposed into multiple intrinsic modal functions using VMD. Second, the IMF subsequence was measured using the MWPE metric, leading to the construction of a new feature matrix. Finally, the CNN-BiLSTM prediction model, incorporating an attention mechanism and optimized using a genetic algorithm, was applied to generate the final prediction results. Using Lushan Scenic Area (China) as a case study, our experimental results demonstrate that the proposed model significantly outperforms benchmark approaches including XGBoost, LSTM and CNN-BiLSTM. The comparative analysis reveals consistent improvements across all evaluation metrics: achieving a minimum 7.46% reduction in the MAPE, at least 7.2% decrease in BRMSE, and a minimum 1.74% enhancement in the R

Indexed as

Attentional mechanismBiLSTMMWPETourism flow predictionVMD

Identifiers

PMID40410234
PMCPMC12102265

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.