Short‐term railway passenger demand forecast using improved Wasserstein generative adversarial nets and web search terms
Bibliographic record
Abstract
Abstract Accurately predicting railway passenger demand is conducive for managers to quickly adjust strategies. It is time‐consuming and expensive to collect large‐scale traffic data. With the digitization of railway tickets, a large amount of user data has been accumulated. We propose a method to predict railway passenger demand using web search terms data. In order to improve the prediction accuracy, we improved Wasserstein Generative Adversarial Nets (WGAN), which were good at generating and identifying data, by adding a predictor and supervised learning adversarial training to predict railway passenger demand. The improved WGAN could generate virtual data to expand real data, and use parallel data to predict railway passenger demand. We used search times of web search terms on different devices as training data to predict railway passenger demand in Beijing. The results show that the change in demand for railway passenger lags behind the change in the data of web search terms by one month. It is suitable for forecasting in advance. Compared with other forecasting methods, the improved WGAN performance is better, and the mean absolute percentage error is 1.98%. Because it can use mixed data for training and prediction, it has stronger adaptability when data scale decreases.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".