MétaCan
Menu
Back to cohort
Record W2004623181 · doi:10.3166/ria.21.255-284

Un métamodèle des graphes conceptuels

2007· article· fr· W2004623181 on OpenAlexaffvenue
Olivier Gerbé, Guy W. Mineau, Rudolph K Keller

Bibliographic record

VenueRevue d intelligence artificielle · 2007
Typearticle
Languagefr
FieldComputer Science
TopicWeb Applications and Data Management
Canadian institutionsUniversité de MontréalUniversité LavalHEC Montréal
Fundersnot available
KeywordsPhilosophyChemistry

Abstract

fetched live from OpenAlex

Metamodeling addresses the issue of formally defining the vocabulary and rules sub- sequently used in modeling activities. On one hand, metamodeling is often identified as a key component in information system development. It defines in a formal way the modeling prim- itives that will be used in system analysis and design activites. On other hand, conceptual graphs are often identified as a key language in knowledge representation because they are sim- ple, expressive and closelyrelated to other familiar modelling languages such as UML or E/R. We propose in this paper a metamodel for conceptual graphs.

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.006
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.028
Threshold uncertainty score0.056

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.006
Meta-epidemiology (narrow)0.0020.002
Meta-epidemiology (broad)0.0020.004
Bibliometrics0.0040.005
Science and technology studies0.0020.004
Scholarly communication0.0080.010
Open science0.0020.002
Research integrity0.0030.007
Insufficient payload (model declined to judge)0.0060.002

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.078
GPT teacher head0.298
Teacher spread0.220 · 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

Citations2
Published2007
Admission routes2
Has abstractyes

Explore more

Same venueRevue d intelligence artificielleSame topicWeb Applications and Data ManagementFrench-language works237,207