Enhancing XRF sensor-based sorting of porphyritic copper ore using particle swarm optimization-support vector machine (PSO-SVM) algorithm
Bibliographic record
Abstract
X-ray fluorescence (XRF) sensor-based ore sorting enables efficient beneficiation of heterogeneous ores, while intraparticle heterogeneity can cause significant grade detection errors, leading to misclassifications and hindering widespread technology adoption. Accurate classification models are crucial to determine if actual grade exceeds the sorting threshold using localized XRF signals. Previous studies mainly used linear regression (LR) algorithms including simple linear regression (SLR), multivariable linear regression (MLR), and multivariable linear regression with interaction (MLRI) but often fell short attaining satisfactory results. This study employed the particle swarm optimization support vector machine (PSO-SVM) algorithm for sorting porphyritic copper ore pebble. Lab-scale results showed PSO-SVM outperformed LR and raw data (RD) models and the significant interaction effects among input features was observed. Despite poor input data quality, PSO-SVM demonstrated exceptional capabilities. Lab-scale sorting achieved 93.0% accuracy, 0.24% grade increase, 84.94% recovery rate, 57.02% discard rate, and a remarkable 39.62 ¥/t net smelter return (NSR) increase compared to no sorting. These improvements were achieved by the PSO-SVM model with optimized input combinations and highest data quality (T=10, T is XRF testing times). The unsuitability of LR methods for XRF sensor-based sorting of investigated sample is illustrated. Input element selection and mineral association analysis elucidate element importance and influence mechanisms.
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.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| 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".