A Random Forest Algorithmic Approach to Predicting Particulate Emissions from a Highly Boosted GDI Engine
Bibliographic record
Abstract
Particulate emissions from gasoline direct injection (GDI) engines continue to be a topic of substantial research interest. Forthcoming regulation both in the USA and the EU will further reduce their emission and drive innovation. Substantial research effort is spent undertaking experiments to understand, characterize, and research particle number (PN) emissions from engines and vehicles. Recent advances in computing power, data storage, and understanding of artificial intelligence algorithms now mean that these are becoming an important tool in engine research. In this work a random forest (RF) algorithm is used for the prediction of PN emissions from a highly boosted (up to 32 bar BMEP) GDI engine. Particle size, concentration, and the accumulation mode geometric standard deviation (GSD) are all predicted by the model. The results are analysed and an in depth study on parameter importance is carried out. The Random Forest algorithm is used as an estimator and the various engine parameters are ranked with a permutation feature importance technique using mean squared error as a performance metric. The results showed that from 82 model parameters only 17 are important for predicting the above PN emission parameters. Moreover, the permutation importance algorithm showed that when the parameters are reduced to 9 the model accuracy is improved due to a reduction in model variance. Overall, the model shows excellent predictive performance for all three parameters even when an independent dataset is used.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| 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".