MétaCan
Menu
Back to cohort
Record W2130506830 · doi:10.1109/tai.1997.632230

A generic tool for distributed AI with matching as message passing

2002· article· en· W2130506830 on OpenAlexaff
Eugene Eberbach

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsAcadia University
Fundersnot available
KeywordsComputer scienceInferenceInference engineGenetic programmingTheoretical computer scienceMessage passingMatching (statistics)ComputationArtificial intelligenceProgramming languageMathematics

Abstract

fetched live from OpenAlex

The paper concentrates on the problem of integrating genetic programming, neural networks, autonomous agents with some symbolic AI techniques. For this purpose, it introduces and employs the S-calculus, which is a general model of computation with a quantitative aspect (cost) allowing naturally to express optimization and modification in dynamic parallel AI systems. The papers presents basic operators of the calculus, and a basic inference engine, so called modifying algorithm, used for problem solving. Next the approach is illustrated through a series of examples from various domains, including symbolic and subsymbolic systems.

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.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.018
Threshold uncertainty score0.059

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0020.002
Science and technology studies0.0010.003
Scholarly communication0.0040.005
Open science0.0040.004
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0180.007

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.016
GPT teacher head0.239
Teacher spread0.223 · 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 designTheoretical or conceptual
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

Citations10
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicEvolutionary Algorithms and ApplicationsFrench-language works237,207