Forecasting of Short-Term Metro Ridership with Support Vector Machine Online Model
Bibliographic record
Abstract
Forecasting for short-term ridership is the foundation of metro operation and management. A prediction model is necessary to seize the weekly periodicity and nonlinearity characteristics of short-term ridership in real-time. First, this research captures the inherent periodicity of ridership via seasonal autoregressive integrated moving average model (SARIMA) and proposes a support vector machine overall online model (SVMOOL) which insets the weekly periodic characteristics and trains the updated data day by day. Then, this research captures the nonlinear characteristics of the ridership via successive ridership value inputs and proposes a support vector machine partial online model (SVMPOL) which insets the nonlinear characteristics and trains the updated data of the predicted day by time interval (such as 5-min). Afterwards, to avoid the drawbacks and to take advantages of the strengths of the two individual online models, this research takes the average predicted values of two models as the final predicted values, which are called support vector machine combined online model (SVMCOL). Finally, this research uses the 5-min ridership at Zhujianglu and Sanshanjie Stations of Nanjing Metro to compare the SVMCOL model with three well-known prediction models including SARIMA, back-propagation neural network (BPNN), and SVM models. The resultant performance comparisons suggest that SARIMA is superior for the stable weekday ridership to other models. Yet the SVMCOL model is the best performer for the unstable weekend ridership and holiday ridership. It shows that for metro operation manager that gear toward timely response to real-world unstable and abnormal situations, the SVMCOL may be a better tool than the three well-known models.
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.000 | 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.001 | 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".