MétaCan
Menu
Back to cohort
Record W2974657091 · doi:10.4018/ijossp.2019070103

A Topic Modeling Based Approach for Enhancing Corpus Querying

2019· article· en· W2974657091 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

VenueInternational Journal of Open Source Software and Processes · 2019
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Text Analysis Techniques
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceQuery expansionRanking (information retrieval)Information retrievalQuery optimizationProcess (computing)Selection (genetic algorithm)Web query classificationWeb search queryData miningQuery languageSargableQuality (philosophy)Search engineMachine learning

Abstract

fetched live from OpenAlex

In information retrieval, the accuracy of the retrieval process is mainly dependent on query terms selection; therefore, the user must choose the needed terms carefully and selectively. Traditionally, the process of selecting query terms is done manually. However, in the last two decades, a lot of research has been directed towards automating the process of choosing and enhancing query terms. In this article, a new novel approach is presented, which relies on topic modeling in query building and expansion. Two open source systems were selected to perform the experiments, results show that adding the topic's term to the user's query clearly improves its quality and thus, improves the ranking results.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.672
Threshold uncertainty score0.546

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.0010.001
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.025
GPT teacher head0.317
Teacher spread0.292 · 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