Prediction of Daily Entrance and Exit Passenger Flow of Rail Transit Stations by Deep Learning Method
Bibliographic record
Abstract
The prediction of entrance and exit passenger flow of rail transit stations is one of key research focuses in the area of intelligent transportation. Based on the big data of rail transit IC card (Public Transportation Card), this paper analyzes the data of major dynamic factors having effect on entrance passenger flow and exit passenger flow of rail transit stations: weather data, atmospheric temperature data, holiday and festival data, ground index data, and elevated road data and calculates the daily entrance passenger flow and daily exit passenger flow of individual rail transit stations with data reduction. Furthermore, based on the history data of passenger flow of rail transit stations and relevant influence factors, it applies the deep learning method to choose the relatively optimal hidden layer node by means of the cut-and-try method, set up input data and labeled data, select the activation function and loss function, and use the Adam Gradient Descent Optimization Algorithm for iterative global convergence. The results verify that this method accurately predicts the daily entrance passenger flow and daily exit passenger flow of rail transit stations with the prediction error of less than 4.1%. Finally, the proposed model is compared with the linear regression model.
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.000 | 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".