Barnacles Mating Optimizer with Deep Transfer Learning Enabled Biomedical Malaria Parasite Detection and Classification
Bibliographic record
Abstract
Biomedical engineering involves ideologies and problem-solving methods of engineering to biology and medicine. Malaria is a life-threatening illness, which has gained significant attention among researchers. Since the manual diagnosis of malaria in a clinical setting is tedious, automated tools based on computational intelligence (CI) tools have gained considerable interest. Though earlier studies were focused on the handcrafted features, the diagnostic accuracy can be boosted through deep learning (DL) methods. This study introduces a new Barnacles Mating Optimizer with Deep Transfer Learning Enabled Biomedical Malaria Parasite Detection and Classification (BMODTL-BMPC) model. The presented BMODTL-BMPC model involves the design of intelligent models for the recognition and classification of malaria parasites. Initially, the Gaussian filtering (GF) approach is employed to eradicate noise in blood smear images. Then, Graph cuts (GC) segmentation technique is applied to determine the affected regions in the blood smear images. Moreover, the barnacles mating optimizer (BMO) algorithm with the NasNetLarge model is employed for the feature extraction process. Furthermore, the extreme learning machine (ELM) classification model is employed for the identification and classification of malaria parasites. To assure the enhanced outcomes of the BMODTL-BMPC technique, a wide-ranging experimentation analysis is performed using a benchmark dataset. The experimental results show that the BMODTL-BMPC technique outperforms other recent approaches.
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.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.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".