MétaCan
Menu
Back to cohort
Record W2395784639

Methods for Matching of Linked Open Social Science Data

2014· dissertation· en· W2395784639 on OpenAlexfundno aff
Benjamin Zapilko

Bibliographic record

VenueMADOC (University of Mannheim) · 2014
Typedissertation
Languageen
FieldComputer Science
TopicSemantic Web and Ontologies
Canadian institutionsnot available
FundersUniversiteit van TilburgUniversität MannheimLeibniz-GemeinschaftUniversity of Toronto
KeywordsData scienceComputer scienceLinked dataOpen dataPopularityMatching (statistics)Domain (mathematical analysis)Open scienceOpen researchSemantic WebKnowledge managementWorld Wide WebPolitical science
DOInot available

Abstract

fetched live from OpenAlex

In recent years, the concept of Linked Open Data (LOD), has gained popularity and acceptance across various communities and domains. Science politics and organizations claim that the potential of semantic technologies and data exposed in this manner may support and enhance research processes and infrastructures providing research information and services. In this thesis, we investigate whether these expectations can be met in the domain of the social sciences. In particular, we analyse and develop methods for matching social scientific data that is published as Linked Data, which we introduce as Linked Open Social Science Data. Based on expert interviews and a prototype application, we investigate the current consumption of LOD in the social sciences and its requirements. Following these insights, we first focus on the complete publication of Linked Open Social Science Data by extending and developing domain-specific ontologies for representing research communities, research data and thesauri. In the second part, methods for matching Linked Open Social Science Data are developed that address particular patterns and characteristics of the data typically used in social research. The results of this work contribute towards enabling a meaningful application of Linked Data in a scientific domain.

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.028
metaresearch head score (Gemma)0.136
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.028
Threshold uncertainty score0.149

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0280.136
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.004
Bibliometrics0.0210.026
Science and technology studies0.0020.002
Scholarly communication0.0090.011
Open science0.0040.011
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0060.004

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.105
GPT teacher head0.394
Teacher spread0.289 · 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 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

Citations1
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueMADOC (University of Mannheim)Same topicSemantic Web and OntologiesFrench-language works237,207