Learning by challenging: A social network and privacy based approach
Bibliographic record
Abstract
Considerable research in the field of Intelligent Tutoring Systems (ITS) has focused on helping students increase learning by taking advantage of technological progress. As the use of social media by learners continues to increase, however, ITS should go beyond teaching based on isolated environments (platforms) and turn toward community-based learning within social networks. In this paper we introduce a new approach to learning based on social networks. This approach takes advantage of the increasing enthusiasm among learners for spending time in social networks. The goal is to use some of that time for learning, by replacing one of the various social game applications with an Intelligent Tutoring Systems (ITS). During a learning session, learners are encouraged to improve their scores by challenging either a score predefined by the system or the scores posted by their Facebook friends. In this paper, we describe a new system called LBC (Learning By Challenging) that enables the user to learn and to share their knowledge and resources in a social environment. It also provides an environment that protects the learner's privacy if he or she so desires.
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.006 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.003 | 0.003 |
| Scholarly communication | 0.005 | 0.010 |
| Open science | 0.003 | 0.006 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".