Machine Learning Based PEVs Load Extraction and Analysis
Bibliographic record
Abstract
Transformation of the energy sector due to the appearance of plug-in electric vehicles (PEVs) has faced the researchers with challenges in recent years. The foremost challenge is uncertain behavior of a PEV that hinders operators determining a deterministic load profile. Load forecasting of PEVs is so crucial in both operating and planning of the energy systems. PEV load demand mainly depends on traveling behavior of them. This paper tries to present an accurate model to forecast PEVs’ traveling behavior in order to extract the PEV load profile. The presented model is based on machine-learning techniques; namely, a generalized regression neural network (GRNN) that correlates between PEVs’ arrival/departure times and traveling behavior is considered in the model. The results show the ability of the GRNN to communicate between arrival/departure times of PEVs and the distance traveled by them with a correlation coefficient (R) of 99.49% for training and 98.99% for tests. Therefore, the trained and saved GRNN model is ready to forecast PEVs’ trip length based on training and testing with historical data. Finally, the results indicate the importance of implementing more accurate methods to predict PEVs to gain the significant advantages in the importance of electrical energy in vehicles in the years to come.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".