MétaCan
Menu
Back to cohort
Record W2372347460

A Study on Taxonomic Relation Extraction from Ontology Learning

2007· article· en· W2372347460 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

VenueComputer Technology and Development · 2007
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Computational Techniques and Applications
Canadian institutionsAthabasca University
Fundersnot available
KeywordsOntology learningComputer scienceOntologyRelation (database)Taxonomy (biology)Process ontologyOntology-based data integrationOpen Biomedical OntologiesUpper ontologySuggested Upper Merged OntologyInformation retrievalOntology componentsDomain (mathematical analysis)Relationship extractionOntology alignmentArtificial intelligenceNatural language processingInformation extractionSemantic WebData miningEcologyMathematicsEpistemology
DOInot available

Abstract

fetched live from OpenAlex

Ontology learning aims at constructing ontology(semi)automatically by integrating a multitude of disciplines such as ontology engineering and machine learning.This can lighten the burden of the manual construction of ontology.This paper introduces a framework of extracting the taxonomic relation semi-automatically for ontology learning from text.The key technologies of ontology learning such as domain concepts extraction and taxonomic relation extraction are discussed.The taxonomic relation of the ontology is realized,but the non-taxonomy relation need to be researched.

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: Observational · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.823
Threshold uncertainty score0.477

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.027
GPT teacher head0.300
Teacher spread0.273 · 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