MétaCan
Menu
Back to cohort
Record W1485129084 · doi:10.1109/iat.2004.71

Improving modeling of other agents using tentative stereotypes and compactification of observations

2004· article· en· W1485129084 on OpenAlexaff
Jörg Denzinger, Joud Hamdan

Bibliographic record

VenueIEEE/WIC/ACM International Conference on Intelligent Agent Technology · 2004
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsCompactification (mathematics)Stereotype (UML)Computer sciencek-nearest neighbors algorithmEconometricsSocial psychologyArtificial intelligencePsychologyMathematics

Abstract

fetched live from OpenAlex

We investigate possible improvements to modeling other agents based on observed situation-action pairs and the nearest neighbor rule. Tentative stereotype models allow for good predictions of a modeled agent's behavior even after few observations. Periodic revaluation of the chosen stereotype and the potential for switching between different stereotypes or to the observation based model aids in dealing with very similar (but not identical) stereotypes and agents that do not conform to any stereotype. Finally, compactification of observations keeps the application of the model efficient by reducing comparisons within the nearest neighbor rule. Our experiments show that stereotyping significantly improves cases where using just the original method performs badly and that revaluation and switching fortify stereotyping against the potential risk of using an incorrect stereotype. Compactification shows good potential for improving efficiency, but is sometimes at risk of losing important observations.

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.021
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.010
Threshold uncertainty score0.022

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.021
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.007
Open science0.0030.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.192
GPT teacher head0.364
Teacher spread0.173 · 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

Citations17
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueIEEE/WIC/ACM International Conference on Intelligent Agent TechnologySame topicMachine Learning and Data ClassificationFrench-language works237,207