MétaCan
Menu
Back to cohort
Record W2156142018 · doi:10.1177/0165551512469929

How is a search system used in work task completion?

2013· article· en· W2156142018 on OpenAlexaff
Elaine G. Toms, Robert Villa, Lori McCay‐Peet

Bibliographic record

VenueJournal of Information Science · 2013
Typearticle
Languageen
FieldComputer Science
TopicInformation Retrieval and Search Behavior
Canadian institutionsDalhousie University
Fundersnot available
KeywordsTask (project management)Computer scienceInformation retrievalSet (abstract data type)Cognitive models of information retrievalInformation seekingWork (physics)Question answeringInformation systemWorld Wide WebHuman–computer interactionHuman–computer information retrievalSearch engine

Abstract

fetched live from OpenAlex

Typically studies of information retrieval and interactive information retrieval concentrate on the identification of relevant items. In this study, rather than stop at finding relevant items, we considered how people use a search system in the completion of a broader work task. To conduct the study, we created 12 tasks that required multiple queries and document views in order to find enough information to complete the task. A total of 381 people completed three tasks each in a laboratory setting using the wikiSearch system that was embedded into WiIRE. Results found that two-thirds of time spent on the task was spent after finding a relevant set of documents sufficient for task completion, and that time was mainly spent reviewing documents that had already been retrieved. Findings suggest that an open-source information retrieval system, such as Lucene, was adequate for this task. However, the ultimate challenge will be in building useful systems that aid the user in extracting, interpreting and analysing information to achieve work task completion.

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.011
metaresearch head score (Gemma)0.088
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.011
Threshold uncertainty score0.058

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0110.088
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.002
Science and technology studies0.0010.001
Scholarly communication0.0060.008
Open science0.0010.002
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0030.003

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.029
GPT teacher head0.274
Teacher spread0.245 · 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 designObservational
Domainnot available
GenreEmpirical

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

Citations19
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Information ScienceSame topicInformation Retrieval and Search BehaviorFrench-language works237,207