MétaCan
Menu
Back to cohort
Record W7142414868 · doi:10.29145/jqm.81.01

Performance of PC and Modified PC Algorithms of Graph Theoretic Approach: A Monte Carlo Simulation Study

2024· article· W7142414868 on OpenAlexaff
Rizwan Fazal, Faizan Hamayat, Tariq Majeed, Salita Salita

Bibliographic record

VenueJournal of Quantitative Methods · 2024
Typearticle
Language
FieldComputer Science
TopicAdvanced Statistical Modeling Techniques
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsSpurious relationshipMonte Carlo methodGraphTerm (time)Monte Carlo algorithmPower (physics)Graph theory

Abstract

fetched live from OpenAlex

Keeping in view the work of Swanson and Granger (1997) among others, the performance of PC algorithm and Modified PC algorithm of graph theoretic approach in term of size and power properties are evaluated using Monte Carlo simulation. The study recommends modified PC algorithm as the dominant approach to causality as it successfully expose the correct causal relationship between variables and best to differentiate between correct and spurious causality.

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.061
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: Empirical · Consensus signal: none
Teacher disagreement score0.014
Threshold uncertainty score0.044

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.061
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.003
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0020.001
Research integrity0.0020.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.164
GPT teacher head0.471
Teacher spread0.307 · 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
GenreEmpirical

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

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Quantitative MethodsSame topicAdvanced Statistical Modeling TechniquesFrench-language works237,207