Can low domain knowledge be compensated for when using the internet
Bibliographic record
Abstract
Previous researchers have found that learners do not benefit fi-om using the Internet when domain knowledge is low. The purpose of the current study was to investigate possible methods to compensate for low domain knowledge. Specifically, the presence of notes, more time to search the Internet, and high levels of motivation to use the Internet were examined as possible compensating factors. Sixty Political Science and Kinesiology undergraduate students were randomly assigned to one of three conditions. Students searched the Internet for an hour prior to vmting an essay with notes present, searched the Internet for an hour prior to writing an essay without notes present, or did not search the Internet prior to completing an essay. Each participant completed the same two essays, one corresponding to a high knowledge domain and another corresponding to a low knowledge domain. First, the presence of notes did not significantly improve essay scores in comparison to the absence of notes. Second, learners did benefit fi-om using the Internet for 1 hour in comparison to their peers who were not exposed to the Internet, regardless of level of domain knowledge. Third, high levels of motivation did not affect essay performance. A discussion of why time may have compensated for low domain knowledge while notes and motivation did not is included. In addition, methods that may compensate for low domain knowledge when time is restricted are suggested.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.017 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".