MétaCan
Menu
Back to cohort
Record W3007116216 · doi:10.1145/3365953.3365955

<i>BENIN</i>

2019· article· en· W3007116216 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsConcordia University
Fundersnot available
KeywordsInferenceComputer scienceBenchmark (surveying)ResamplingMachine learningArtificial intelligenceFeature selectionComplementarity (molecular biology)Data miningGene regulatory networkGene expressionGeneBiology

Abstract

fetched live from OpenAlex

Gene regulatory network inference is one of the central problems in computational biology. The limited availability of biological data as well as the intrinsic noise they contain have triggered the need of models that integrate the vast variety of data available to take advantage of the complementarity of the information they provide about regulation. With this idea in mind, we propose BENIN: Biologically Enhanced Network INference. BENIN is a general framework that jointly considers prior knowledge with expression data to boost the network inference. This method considers network inference as a feature selection problem. To solve it, BENIN uses a penalized regression method, elastic net, combined with bootstrap resampling. Using the benchmark dataset from the DREAM 4 challenge, we demonstrate that, when using times series expression data with knockout gene expression data, BENIN significantly outperforms other methods.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.931
Threshold uncertainty score0.998

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.002

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.006
GPT teacher head0.212
Teacher spread0.206 · 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

Quick stats

Citations2
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207