Overlapping peak separation algorithm for ion mobility spectra based on multistrategy JAYA
Bibliographic record
Abstract
RATIONALE: In the field of separation science, ion mobility spectrometry (IMS) plays an important role as an analytical tool. However, the lack of sufficient structural resolution is a common problem in qualitative and quantitative analysis using IMS. A method is needed to solve the problem of overlapping peaks caused by insufficient resolution. METHODS: The method uses multiple strategies to more effectively use population information to balance exploration and exploitation capabilities, prevent local optimization, accurately resolve overlapping peaks, quickly obtain optimal spectral peak model coefficients, and accurately identify compounds. RESULTS: Multistrategy JAYA algorithm's (MSJAYA) performance is compared with improved particle swarm optimization (IPSO), dynamic inertia weight particle swarm optimization (DIWPSO), and multiobjective dynamic teaching-learning-based optimization (MDTLBO). The analysis shows that MSJAYA's maximum separation error is within 0.6%, a level of accuracy not guaranteed by the other algorithms. In addition, the separation error fluctuates within a much smaller range, demonstrating MSJAYA's superior robustness. CONCLUSIONS: Compared with other overlapping peak separation algorithms, MSJAYA is more applicable because no special parameters are used. The method allows fast deconvolution analysis of strong overlapping peaks with multiple components, which greatly improves the resolution of IMS.
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.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".