Numerical Differentiation From Noisy Signals: A Kernel Regularization Method to Improve Transient-State Features for the Electronic Nose
Bibliographic record
Abstract
As the simplest feature extraction, traditional hand-crafted transient-state features have been widely used in the area of electronic noses (e-noses). However, the influence of noise in the calculation of numerical differentiation leads to inaccuracy and instability in extracting these features. To tackle this issue, a novel numerical differentiation algorithm is proposed, which uses kernel-based regularization. The proposed method can provide accurate and stable transient-state features by directly estimating high-order derivatives from the noise-contaminated sensor’s reading. The feature representation is a prerequisite for the good performance of e-noses. Nevertheless, it should be noted that this performance in real applications can still be affected by other factors, such as sensor drift and the disturbance of nontarget odors. These issues can be addressed by applying a framework of domain adaptation and one-class classification. The proposed method and the adopted framework are verified in a field experiment, which identifies the odor of four targets and two disturbance whiskies measured by a self-designed e-nose system. The classification accuracy with traditional features is improved from$\mathbf{71.90\%}$to$\mathbf{86.36\%}$, showing the good potential of the proposed method for application in the area of e-noses.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".