A manifold intelligent decision system for fusion and benchmarking of deep waste-sorting models
Bibliographic record
Abstract
Increases in population and prosperity are linked to a worldwide rise in garbage. The “classification” and “recycling” of solid waste is a crucial tactic for dealing with the waste problem. This paper presents a new two-layer intelligent decision system for waste sorting based on fused features of Deep Learning (DL) models as well as a selection of an optimal deep Waste-Sorting Model (WSM) based on Multi-Criteria Decision Making (MCDM). A dataset comprising 1451 samples of images of waste, distributed across four classes – cardboard (403), glass (501), metal (410), and general trash (137), was used for sorting. This study proposes a Multi-Fused Decision Matrix (MFDM) based on identified fusion score level rules, evaluation criteria, and deep fused waste-sorting models. Five fusion rules used in the sorting process and the evaluation perspectives into the MFDM are sum, weighted sum, product, maximum, and minimum rules. Additionally, each of entropy and Visekriterijumska Optimizacija i Kompromisno Resenje in Serbian (VIKOR) methods was used for weighting selected criteria as well as ranking deep WSMs. The highest accuracy rate of 98% was scored by ResNet50-GoogleNet- Inception based on the minimum rule. However, under the same rule, an insufficient accuracy rate of sorting was presented by ResNet50-GoogleNet-Xception. Since Qi = 0 for Inception-Xception, the final output based on MCDM methods indicates that the fused Inception-Xception model outperforms the other fused deep WSMs, which achieved the lowest values of Qi. Thus, Inception-Xception was chosen as the best deep waste-sorting model based on images of waste, multiple evaluation criteria, and different fusion perspectives. The mean and standard deviation metrics were both used to validate the selection findings objectively. The suggested approach can aid urban decision-makers in prioritizing and choosing an Artificial Intelligence (AI)-optimized optimal sorting model.
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.004 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".