Optimal Machine Learning Based Automated Malaria Parasite Detection and Classification Model Using Blood Smear Images
Bibliographic record
Abstract
Malaria is a deadly disease which can be spread by the Plasmodium parasites.The existence of malaria can be identified by professional microscopists who examine the microscopic blood smear images.But it remains a challenge owing to the unavailability of experts, poor resolution images, and insufficient diagnostic quality.Therefore, image processing and machine learning (ML) models can be employed to detection of malaria parasites using blood smear images.With this motivation, this study introduces an optimal machine learning based automated malaria parasite detection and classification (OML-AMPDC) model using blood smear images.The proposed OML-AMPDC technique primarily undergoes preprocessing in two stages namely adaptive filtering (AF) based noise removal and contrast enhancement using CLAHE technique.Besides, the feature extraction process was implemented using Local Derivative Radial Patterns (LDRP).In addition, random forest (RF) classifier is applied to allot proper class labels to the blood smear images.Finally, particle swarm optimization (PSO) algorithm was utilized for optimally choose two parameters of the RF model, named maximum number of levels in every decision tree (max_depth) and number of trees in the forest (n_estimators).The design of PSO algorithm helps for enhancing the classification performance of the RF method.A wide-ranging experimental analysis is performed using benchmark dataset and the results reported the betterment of the OML-AMPDC technique over the 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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 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.001 | 0.000 |
| 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".