MétaCan
Menu
Back to cohort
Record W2156875947 · doi:10.1109/isit.1997.613406

A measure for the length of probabilistic dependence

2002· article· en· W2156875947 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
TopicCellular Automata and Applications
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsProbabilistic logicMarkov processMeasure (data warehouse)Markov modelMarkov chainVariable-order Markov modelComputer scienceAlgorithmStatistical modelMarkov renewal processMarkov propertyMathematicsStatistical physicsArtificial intelligenceStatisticsMachine learningData miningPhysics

Abstract

fetched live from OpenAlex

A very useful model to describe a random process with memory is the Markov model. The MLSE receiver based on a finite order Markov model is studied in Kong and Shwedyk (1995). It is found that the order of the Markov model, i.e., the length of probabilistic dependence, is the crucial parameter that determines the receiver complexity. An information-theoretic measure for the length of probabilistic dependence is proposed.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.978
Threshold uncertainty score0.105

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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.042
GPT teacher head0.235
Teacher spread0.193 · 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

Citations7
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicCellular Automata and ApplicationsFrench-language works237,207