MétaCan
Menu
Back to cohort
Record W2008811315 · doi:10.1109/ita.2013.6502959

Inferring causality in networks of WSS processes by pairwise estimation methods

2013· article· en· W2008811315 on OpenAlexaff
Syamantak Datta Gupta, Ravi R. Mazumdar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene Regulatory Network Analysis
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsPairwise comparisonCausality (physics)Granger causalityComputer scienceContext (archaeology)InterdependenceSet (abstract data type)Process (computing)Stochastic processEconometricsVariety (cybernetics)Relation (database)Artificial intelligenceData miningMachine learningMathematicsStatistics

Abstract

fetched live from OpenAlex

Inferring causal dependences in a family of dynamic systems from a finite set of observations is a problem encountered in many applications that arise in a diverse variety of fields; ranging from economics and finance to climatology and neuroscience. Given a set of random processes, the objective is to determine whether one process is influenced by the others and to investigate the nature of this influence in case a dependence relation is identified. The notion of Granger-causality may be used in this context to measure and quantify causal structures. Ideally, in order to infer the complete interdependence structure of a complex system, one should simultaneously consider the dynamic behaviour of all the processes involved. However, for large networks, such a method becomes exceedingly complicated. In this paper, we consider an interdependent group of jointly wide sense stationary real-valued stochastic processes and investigate the problem of determining Granger-causality by identifying pairwise causal relations. It is seen that while such methods may not reveal all details of a system, they can nonetheless provide useful and reasonably accurate information.

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.008
metaresearch head score (Gemma)0.034
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.008
Threshold uncertainty score0.040

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.034
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0040.003
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.009
GPT teacher head0.292
Teacher spread0.283 · 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

Citations2
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicGene Regulatory Network AnalysisFrench-language works237,207