MétaCan
Menu
Back to cohort
Record W2120748206 · doi:10.1109/isb.2011.6033114

Inferring gene regulatory networks from multiple time course gene expression datasets

2011· article· en· W2120748206 on OpenAlexafffund
Bolin Chen, Lizhi Liu, Fang‐Xiang Wu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene Regulatory Network Analysis
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsInferenceComputer scienceGene regulatory networkConstraint (computer-aided design)Data miningScheme (mathematics)Machine learningArtificial intelligenceGeneGene expressionMathematicsBiologyGenetics

Abstract

fetched live from OpenAlex

We proposed a scheme to infer gene regulatory networks from multiple time course gene expression datasets. As the scarcity of time course data, most current methods usually making the inferred gene regulatory network structure as an ill-posed one, and typically cannot handle multiple experimental datasets directly. On the other hand, gene expression data generated by different groups worldwide are increasingly accumulated. In this paper, we first formulate the inference of sparse and stable gene regulatory networks as a constraint optimization problem, which can be easily solved by a given single dataset. Then, two methods of network combination are proposed, which can combine structures inferred from various experimental datasets. After that, the parameters in gene regulatory network with that structure are estimated by solving another optimization problem. Finally, we test and validate our methods on synthetic datasets in a series of numerical experiments in terms of the structure accuracy and the model error.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.012
GPT teacher head0.216
Teacher spread0.204 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations5
Published2011
Admission routes2
Has abstractyes

Explore more

Same topicGene Regulatory Network AnalysisFrench-language works237,207