MétaCan
Menu
Back to cohort
Record W2121897210 · doi:10.1109/tai.2002.1180827

TimeSleuth: a tool for discovering causal and temporal rules

2003· article· en· W2121897210 on OpenAlexaff
Kamran Karimi, Howard J. Hamilton

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsComputer scienceCausality (physics)Association rule learningBayesian networkArtificial intelligenceData miningTree (set theory)PreprocessorMachine learningData scienceMathematics

Abstract

fetched live from OpenAlex

Discovering causal and temporal relations in a system is essential to understanding how it works, and to learning to control the behaviour of the system. TimeSleuth is a causality miner that uses association relations as the basis for the discovery of causal and temporal relations. It does so by introducing time into the observed data. TimeSleuth uses C4.5 as its association discoverer, and by using a series of preprocessing and post-processing techniques to enable the user to try different scenarios for mining causality. The data to be mined should originate sequentially from a single system. TimeSleuth's use of a standard decision tree builder such as C4.5 puts it outside the current mainstream method of discovering causality, which is based on conditional independencies and causal Bayesian networks. This paper introduces TimeSleuth as a tool, and describes its functionality. It is an unsupervised tool that can handle and interpret temporal data. It also helps the user in analyzing the relationships among the attributes. There is also a mechanism to distinguish between causality and acausal relations. The user is thus encouraged to perform experiments and discover the nature of relationships among the data.

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.004
metaresearch head score (Gemma)0.019
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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.022
Threshold uncertainty score0.073

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.019
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0060.003
Science and technology studies0.0010.001
Scholarly communication0.0030.006
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0220.005

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.020
GPT teacher head0.263
Teacher spread0.243 · 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

Citations21
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207