SPLANG—a synthetic poisson-lognormal-based abundance and network generative model for microbial interaction inference algorithms
Bibliographic record
Abstract
Microbes are pervasive and their interaction with each other and the environment can impact fields as diverse as health and agriculture. While network inference and related algorithms that use abundance data from pyrosequencing can infer microbial interaction networks, the ambiguity surrounding the actual underlying networks hampers the validation of these algorithms. This study introduces a generative model to synthesize both the underlying interactive network and observable abundance data, serving as a test bed for the existing and future network inference algorithms. We tested our generative model with four typical network inference algorithms; our results suggest that none of these algorithms demonstrate adequate accuracy for inferring ecologies of non-commensalistic species, either mutualistic or competitive. We further explored the potential for predictability by combining existing algorithms with an oracle algorithm built by fusing the results of several existing algorithms. The oracle algorithm reveals promising improvements in predictability, although it falls short when applied to networks characterized by dense interspecies taxa interactions. Our work underscores the need for the continued development and validation of algorithms to unravel the intricacies of microbial interaction networks.
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.004 | 0.016 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| 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".