MétaCan
Menu
Back to cohort
Record W2528570251 · doi:10.3233/ao-160171

Choosing ontologies for reuse

2016· article· en· W2528570251 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueApplied Ontology · 2016
Typearticle
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceReuseSoftware engineeringProgramming languageInformation retrievalTheoretical computer science

Abstract

fetched live from OpenAlex

The task of designing an ontology through reuse is difficult, and a major challenge in this effort is choosing between different ontologies that are candidates for reuse. To address this challenge, we introduce a notion of preference between ontologies and provide a definition that allows the devel oper to make a well-founded comparison across a set of ontologies, with respect to their semantic requirements. The preference between ontologies is based on an assessment of relative accuracy and precision, which are also defined here. These concepts formalize the underlying intuitions related to the different possible outcomes in the assessment of an ontology against a developer’s semantic requirements. We also present a procedure to demonstrate the viability of the definition of preference, resulting in a novel approach to the choice between ontologies for reuse; it is sufficiently well-defined such that it could provide the basis for tool support to assist in this task. By providing ontology developers with a means of effectively comparing different ontologies for reuse, this work addresses several of the key limitations for ontology reuse, as identified by the 2014 Ontology Summit Communiqué (Obrst et al., 2014, pp. 155–170).

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.

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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.802
Threshold uncertainty score0.432

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.0020.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.024
GPT teacher head0.253
Teacher spread0.229 · 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