Hydrogen Storage on Porous Carbon Adsorbents: Rediscovery by Nature-Derived Algorithms in Random Forest Machine Learning Model
Bibliographic record
Abstract
Porous carbons as solid adsorbent materials possess effective porosity characteristics that are the most important factors for gas storage. The chemical activating routes facilitate hydrogen storage by adsorbing on the high surface area and microporous features of porous carbon-based adsorbents. The present research proposed to predict H2 storage using four nature-inspired algorithms applied in the random forest (RF) model. Various carbon-based adsorbents, chemical activating agents, ratios, micro-structural features, and operational parameters as input variables are applied in the ML model to predict H2 uptake (wt%). Particle swarm and gray wolf optimizations (PSO and GWO) in the RF model display accuracy in the train and test phases, with an R2 of ~0.98 and 0.91, respectively. Sensitivity analysis demonstrated the ranks for temperature, total pore volume, specific surface area, and micropore volume in first to fourth, with relevancy scores of 1 and 0.48. The feasibility of algorithms in training sizes 80 to 60% evaluated that RMSE and MAE achieved 0.6 to 1, and 0.38 to 0.52. This study contributes to the development of sustainable energy sources by providing a predictive model and insights into the design of porous carbon adsorbents for hydrogen storage. The use of nature-inspired algorithms in the model development process is also a novel approach that could be applied to other areas of materials science and engineering.
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.000 | 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.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 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 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".