A novel sensor array and classifier optimization method of electronic nose based on enhanced quantum-behaved particle swarm optimization
Bibliographic record
Abstract
Purpose – The purpose of the paper is to propose a new optimization algorithm to realize a synchronous optimization of sensor array and classifier, to improve the performance of E-nose in the detection of wound infection. When an electronic nose (E-nose) is used to detect the wound infection, sensor array’s optimization and parameters’ setting of classifier have a strong impact on the classification accuracy. Design/methodology/approach – An enhanced quantum-behaved particle swarm optimization based on genetic algorithm, genetic quantum-behaved particle swarm optimization (G-QPSO), is proposed to realize a synchronous optimization of sensor array and classifier. The importance-factor (I-F) method is used to weight the sensors of E-nose by its degree of importance in classification. Both radical basis function network and support vector machine are used for classification. Findings – The classification accuracy of E-nose is the highest when the weighting coefficients of the I-F method and classifier’s parameters are optimized by G-QPSO. All results make it clear that the proposed method is an ideal optimization method of E-nose in the detection of wound infection. Research limitations/implications – To make the proposed optimization method more effective, the key point of further research is to enhance the classifier of E-nose. Practical implications – In this paper, E-nose is used to distinguish the class of wound infection; meanwhile, G-QPSO is used to realize a synchronous optimization of sensor array and classifier of E-nose. These are all important for E-nose to realize its clinical application in wound monitoring. Originality/value – The innovative concept improves the performance of E-nose in wound monitoring and paves the way for the clinical detection of E-nose.
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.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".