Clustering of genes from microarray data using hierarchical projective adaptive resonance theory: a case study of tuberculosis
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We propose the hierarchical Projective Adaptive Resonance Theory (PART) algorithm for classification of gene expression data. This algorithm is realized by combing transposed quasi-supervised PART and unsupervised PART. We develop the corresponding validation statistics for each process and compare it with other clustering algorithms in a case study of tuberculosis (TB). First, we use sample-based transposed quasi-supervised PART to obtain optimal clustering results of samples distinguished by time post-infection and the representative genes for each cluster including up-regulated, down-regulated and stable genes. The up- and down-regulated genes show more than 90% similarity to the result derived from Linear Models for Microarray Data and are verified by weighted k-nearest neighbor model on TB projection. Second, we use gene-based unsupervised PART algorithm to cluster these representative genes where functional enrichment analysis is conducted in each cluster. We further confirm the main immune response of human macrophage-like THP-1 cells against TB within 2 days is type I interferon-mediated innate immunity. This study demonstrates how hierarchical PART algorithm analyzes microarray data. The sample-based quasi-supervised PART extracts representative genes and narrows down the shortlist of disease-relevant genes and gene-based unsupervised PART classifies representative genes that help to interpret immune response against TB.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it