Balanced Functional Module Detection in genomic data
Bibliographic record
Abstract
Motivation: High-dimensional genomic data can be analyzed to understand the effects of variables on a target variable such as a clinical outcome. For understanding the underlying biological mechanism affecting the target, it is important to discover the complete set of relevant variables. Thus variable selection is a primary goal, which differs from a prediction criterion. Of special interest are functional modules, cooperating sets of variables affecting the target which can be characterized by a graph. In applications such as social networks, the concept of balance in undirected signed graphs characterizes the consistency of associations within the network. This property requires that the module variables have a joint effect on the target outcome with no internal conflict, an efficiency that may be applied to biological networks. Results: In this paper, we model genomic variables in signed undirected graphs for applications where the set of predictor variables influences an outcome. Consequences of the balance property are exploited to implement a new module discovery algorithm, balanced Functional Module Detection (bFMD), which selects a subset of variables from high-dimensional data that compose a balanced functional module. Our bFMD algorithm performed favorably in simulations as compared to other module detection methods. Additionally, bFMD detected interpretable results in an application using RNA-seq data obtained from subjects with Uterine Corpus Endometrial Carcinoma using the percentage of tumor invasion as the outcome of interest. The variables selected by bFMD have improved interpretability due to the logical consistency afforded by the balance property. Supplementary information: online.
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.003 | 0.013 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 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.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".