A Transfer Learning–Based LSTM for Traffic Flow Prediction with Missing Data
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Traffic flow prediction plays an important role in intelligent transportation systems (ITS) on freeways. However, incomplete traffic information tends to be collected by traffic detectors, which is a major constraint for existing methods to get precise traffic predictions. To overcome this limitation, this study aims to propose and evaluate a new advanced model, named transfer learning–based long short-term memory (LSTM) model for traffic flow forecasting with incomplete traffic information, that adopts traffic information from similar locations for the target location to increase the data quality. More specifically, dynamic time warping (DTW) is used to evaluate the similarity between the source and target domains and then transfer the most similar data to the target domain to generate a hybrid complete training sample for LSTM to improve the prediction performance. To evaluate the effectiveness of the transfer learning–based LSTM, this study implements empirical studies with a real-world data set collected from a stretch of I-15 freeway in Utah. Experimental study results indicate that the transfer learning–based LSTM network could effectively predict the traffic flow conditions with a training sample with missing values.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it