MétaCan
Menu
Back to cohort

A Formal Definition of Object-Action Complexes and Examples at Different Levels of the Processing Hierarchy

2009· article· en· W7981553 on OpenAlexvenueno aff
Norbert Krüger, Justus Piater, Florentin Wörgötter, Christopher Geib, Ronald P. A. Petrick, Mark Steedman, Tamim Asfour, Dirk Kraft, Bernhard Hommel, Alejandro Agostini, Danica Kragić, Jan‐Olof Eklundh, Volker Krüger, Carme Torras, Rüdiger Dillmann

Bibliographic record

VenueComputer and Information Science · 2009
Typearticle
Languageen
FieldComputer Science
TopicAI-based Problem Solving and Planning
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceAffordanceObject (grammar)Relation (database)Action (physics)HierarchyFunction (biology)Space (punctuation)Process (computing)Measure (data warehouse)Reliability (semiconductor)Artificial intelligenceTheoretical computer scienceHuman–computer interactionData miningProgramming language

Abstract

fetched live from OpenAlex

In this report the authors define and describe the concept of Object-Action Complexes and give some examples. OACs combine the concept of affordance with the computational efficiency of STRIPS. Affordance is the relation between a situation and the action that it allows. OACs are proposed as a framework for representing actions, objects and the learning process that constructs such representations at all levels. Formally, an OAC is defined as a triplet, composed of a unique ID, a predition function that codes the systems belief on how the world (which is defined as a kind of global attribute space) will change after applying the OAC and a statisical measure representing the success of an OAC. The prediction function is thereby a mapping within the global attribute space. The measurement captures the accuracy of this prediction function and describes the reliability of the OAC. Therefore, it can be used for optimal decision making, predicion of the outcome of a certain action and learning.

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.003
metaresearch head score (Gemma)0.012
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.006
Threshold uncertainty score0.019

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.012
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0030.003
Science and technology studies0.0020.006
Scholarly communication0.0050.007
Open science0.0030.002
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0060.001

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.055
GPT teacher head0.264
Teacher spread0.209 · 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

Citations23
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueComputer and Information ScienceSame topicAI-based Problem Solving and PlanningFrench-language works237,207