Deep Learning for Nematode Image-based Antiparasitic Drug Discovery
Bibliographic record
Abstract
Deep learning has revolutionized the domain of computer vision, with various neural network architectures excelling in tasks like biomedical image classification. This thesis focuses on using deep learning methods to automate the classification of nematode images for drug discovery. The process involves visually examining thousands of images of C. elegans exposed to natural extracts for signs of abnormal development, including morphological defects and reproductive issues. Our dataset comprises 12,717 microscopic images associated with natural product extracts. Approximately one-third of the images are labeled by an expert, and the remaining are unlabeled. Depending on the drug discovery objective, we define the classification as binary (Normal/Abnormal), the most common six (including only the most common six phenotype combinations), or 27 classes (including all phenotype combinations). Initially, we explored fully supervised and semi-supervised learning approaches for binary classification, utilizing high-confidence pseudo-labels from the unlabeled data to progressively enrich our training dataset. To better identify groups with similar visual observations and improve the classification performance, we propose the Triple Cluster Classification (TriCC) method, which enables the detection of underlying feature patterns in C. elegans. TriCC includes self-supervised contrastive learning, unsupervised image clustering, and supervised classification using labeled data to map clusters to the phenotype combinations. Following this, we propose a semi-supervised nematode image classifier based on self-supervised representation learning with Mix-up Barlow Twins (MBT-NC). This system integrates self-supervised learning (SSL) for feature representation (MBT) with a supervised classification stage (NC). We use additional linear interpolated samples in MBT to enhance batch information utilization. The MBT-NC outperforms the two previously developed methods, achieving test accuracies of 89.6%, 83.4%, and 77.6% for binary, six-class, and twenty-seven-class classifications, respectively.
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.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.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".