Supervised Learning by Evolutionary Computation Tuning: An Application to Blockchain-Based Pharmaceutical Supply Chain Cost Model
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A pharmaceutical supply chain (PSC) is a system of processes, operations, and organisations for drug delivery. This paper provides a new PSC mathematical cost model, which includes Blockchain technology (BT), that can improve the safety, performance, and transparency of medical information sharing in a healthcare system. We aim to estimate the costs of the BT-based PSC model, select algorithms with minimum prediction errors, and determine the cost components of the model. After the data generation, we applied four Supervised Learning algorithms (k-nearest neighbour, decision tree, support vector machine, and naive Bayes) combined with two Evolutionary Computation algorithms (ant colony optimization and the firefly algorithm). We also used the Feature Weighting approach to assign appropriate weights to all cost model components, revealing their importance. Four performance metrics were used to evaluate the cost model, and the total ranking score (TRS) was used to determine the most reliable predictive algorithms. Our findings show that the ACO-NB and FA-NB algorithms perform better than the other six algorithms in estimating the costs of the model with lower errors, whereas ACO-DT and FA-DT show the worst performance. The findings also indicate that the shortage cost, holding cost, and expired medication cost more strongly influence the cost model than other cost components.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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 it