Machine Learning‐Based Prediction of Parking Space Availability in IoT‐Enabled Smart Parking Management Systems
Bibliographic record
Abstract
Parking space management has become a critical challenge in urban areas due to increasing vehicle numbers and limited parking infrastructure. This paper presents a comprehensive study of machine learning (ML) models in IoT‐enabled environments focusing on proposing an ML‐based model for predicting available parking space. The study evaluates the performance of various models including K‐nearest neighbors (KNNs), support vector machines (SVMs), random forest (RF), decision tree (DT), logistic regression (LR), and Naïve Bayes (NB) based on “precision, recall, accuracy, and F1‐score performance metrics”. The results obtained by implementing ML models on the data with 65% and 85% threshold values are compared to draw meaningful conclusions regarding their performance in predicting parking space availability. Among the evaluated models, random forest (RF) demonstrates superior performance with high precision, recall, accuracy, and F1‐score values. It showcases its effectiveness in accurately predicting parking space availability in the IoT‐enabled environment. On the other hand, models such as K‐nearest neighbors (KNNs), decision tree (DT), logistic regression (LR), and Naïve Bayes (NB) show relatively lower performance in complex parking scenarios. The paper concludes that the use of advanced predictive models, particularly random forest, significantly enhances the accuracy and reliability of IoT‐enabled parking management systems and also reduces the waiting time of the vehicles, leading to more efficient resource utilization, reduced traffic congestion in real‐time scenarios, and better user satisfaction in the IoT‐enabled environment.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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.000 | 0.000 |
| 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".