MétaCan
Menu
Back to cohort
Record W1496635720 · doi:10.1109/ithet.2004.1358231

ATIA: algorithm teaching interface agent

2004· article· en· W1496635720 on OpenAlexaff
Elhadi Shakshuki, T. Müldner, B. Haughn

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsAcadia University
Fundersnot available
KeywordsComputer scienceReusabilityInterface (matter)AbstractionScheduleVisualizationHuman–computer interactionAlgorithmArtificial intelligenceProgramming languageSoftwareParallel computingOperating system

Abstract

fetched live from OpenAlex

This work presents an intelligent algorithm teaching interface agent (ATIA) that teaches algorithms. This agent is autonomous, goal-driven, dynamic and collaborative, and acts as a mediator between the student and the tutoring environment. It monitors the student's habits and weaknesses to adapt its didactic directions based on his/her interests and preferences. This approach facilitates the reusability of this agent in different tutoring domains, such as iterative and recursive algorithms. ATIA offers to students a common, flexible and customizable interface that they can use for different algorithms. It explains an algorithm at various levels of abstraction. Each level is designed to present a single operation used in the algorithm. Operations are shown in a textual form of a pseudocode with an associated visualization. ATIA can make changes to the schedule of the algorithm lessons based on the student's performance. To demonstrate and evaluate the feasibility of the proposed agent, we describe a prototype, which is being developed.

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 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.813
Threshold uncertainty score0.415

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.0000.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.018
GPT teacher head0.270
Teacher spread0.252 · 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 teacher head, 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

Citations3
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicMulti-Agent Systems and NegotiationFrench-language works237,207