Efficient implementation of a wavelet neural network model for short-term traffic flow prediction: Sensitivity analysis
Bibliographic record
Abstract
The concept of a smart city has emerged to address significant challenges arising from rapid urbanization, economic growth, and climate change. Innovative technology solutions can be used as a means to promote sustainable and inclusive urban development. Effective strategies such as the deployment of the internet of things (IoT), artificial intelligence (AI), energy management, and smart transportation. In the smart city, intelligent transportation systems (ITS) are playing a vital role in efficient traffic management. This paper explores the use of hybrid artificial intelligence techniques for predicting short-term traffic flow data from M25 motorways in the UK. Since volume traffic flow data are non-stationary, wavelet transform (WT) as a powerful signal analyzer is applied for signal decomposition for the elimination of redundant data from input matrices. The feature selection method based on Gram-Schmidt (GS) is used for the selection of more valuable features. The elimination of redundant data can speed up the learning process and improve the generalisation capability of the prediction models. After a pre-processing stage, a wavelet neural network (WNN) with a simple structure is applied as a powerful prediction tool. Two separate structures are considered for the prediction of weekday and weekend traffic volume data. The experiments explore that the debauchies-4 (db4) wavelet function with 7 decomposition levels leads to the best detection accuracy. Moreover, the range of forecasting, the type of the day, the level of decomposition, and other factors all have an impact on prediction stability. Compared with existing prediction methods, the proposed approach produces lower values of root mean square error (RMSE) and mean absolute percentage error (MAPE) for all step-horizons analyzed. These findings provide valuable implications and insights into the development of an efficient and reliable road condition monitoring system for delivering secure and sustainable transportation services.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".